Advertisement

OR Spectrum

, Volume 34, Issue 1, pp 43–68 | Cite as

On bilevel machine scheduling problems

  • Tamás KisEmail author
  • András Kovács
Regular Article

Abstract

Bilevel scheduling problems constitute a hardly studied area of scheduling theory. In this paper, we summarise the basic concepts of bilevel optimisation, and discuss two problem classes for which we establish various complexity and algorithmic results. The first one is the bilevel total weighted completion time problem in which the leader assigns the jobs to parallel machines and the follower sequences the jobs assigned to each machine. Both the leader and the follower aims to minimise the total weighted completion time objective, but with different job weights. When the leader’s weights are arbitrary, the problem is NP-hard. However, when all the jobs are of unit weight for the leader, we provide a heuristic algorithm based on iterative LP-rounding along with computational results, and provide a sufficient condition when the LP-solution is integral. In addition, if the follower weights induce a monotone (increasing or decreasing) processing time order in any optimal solution, the problem becomes polynomially solvable. As a by-product, we characterise a new polynomially solvable special case of the MAX m-CUT problem, and provide a new linear programming formulation for the \({P||\sum_j C_j}\) problem. Finally, we present some results on the bilevel order acceptance problem, where the leader decides on the acceptance of orders and the follower sequences the jobs. Each job has a deadline and if a job is accepted, it cannot be late. The leader’s objective is to maximise the total weight of accepted jobs, whereas the follower aims at minimising the total weighted job completion times. For this problem, we generalise some known single-level machine scheduling algorithms.

Keywords

Scheduling Bilevel optimisation MAX m-CUT Linear programming Approximation algorithms 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agnetis A, Mirchandani PB, Pacciarelli D, Pacifici A (2004) Scheduling problems with two competing agents. Oper Res 52: 229–242CrossRefGoogle Scholar
  2. Brucker P (2007) Scheduling algorithms, 5th edn. Springer, BerlinGoogle Scholar
  3. Cardinal J, Demaine ED, Fiorini S, Joret G, Langerman S, Newman I, Weimann O (2009) The Stackelberg minimum spanning tree game. Algorithmica (in press)Google Scholar
  4. Chen B, Potts CN, Wöginger GJ (1998) A review of machine scheduling: Complexity, algorithms and approximability. In: Du D-Z, Pardalos P (eds) Handbook of Combinatorial Optimization. Kluwer, DordrechtGoogle Scholar
  5. Dempe S, Richter K (2000) Bilevel programming with knapsack constraints. Cent Eur J Oper Res 8: 93–107Google Scholar
  6. Dempe S (2002) Foundations of Bilevel Programming. Kluwer, DordrechtGoogle Scholar
  7. Dempe S (2003) Annotated bibliography on bilevel programming and mathematical programming with equilibrium constraints. Optimization 52: 333–359CrossRefGoogle Scholar
  8. DeNegre ST, Ralphs TK (2009) A branch-and-cut algorithms for integer bilevel programs. In: Chinneck JW, Kristjansson B, Saltzman M (eds) Operations Research and cyber-infrastructure. Springer, Berlin, pp 65–78Google Scholar
  9. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: A survey. Ann Oper Res 5: 287–326Google Scholar
  10. Harjunkoski I, Grossmann IE (2002) Decomposition techniques for multistage scheduling problems using mixed-integer and constraint programming methods. Comput Chem Eng 26: 1533–1552CrossRefGoogle Scholar
  11. Hoogeveen H (2005) Multicriteria scheduling. Eur J Oper Res 167: 592–623CrossRefGoogle Scholar
  12. Karlof JK, Wang W (1996) Bilevel programming applied to the flowshop scheduling problem. Comput Oper Res 23: 443–451CrossRefGoogle Scholar
  13. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum Press, New YorkGoogle Scholar
  14. Lasserre JB (1992) An integrated model for job-shop planning and scheduling. Manage Sci 38: 1201–1211CrossRefGoogle Scholar
  15. Lawler EL, Moore JM (1969) A functional equation and its application to resource allocation and sequencing problems. Manage Sci 16: 77–84CrossRefGoogle Scholar
  16. Lukac̆ Z, S̆orić K, Rosenzweig V (2008) Production planning problem with sequence dependent setups as a bilevel programming problem. Eur J Oper Res 187: 1504–1512CrossRefGoogle Scholar
  17. Marcotte P, Savard G (2005) Bilevel programming: a combinatorial perspective. In: Avis D, Hertz A, Marcotte O (eds) Graph Theory and Combinatorial Optimization. Springer, Berlin, pp 191–218CrossRefGoogle Scholar
  18. Moore JM (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manage Sci 15: 102–109CrossRefGoogle Scholar
  19. Nisan N, Ronen A (2001) Algorithmic mechanism design. Games Econ Behav 35: 166–196CrossRefGoogle Scholar
  20. Sahni SK (1976) Algorithms for scheduling independent tasks. J ACM 23: 116–127CrossRefGoogle Scholar
  21. Tardos É (1986) A strongly polynomial algorithm for solving combinatorial linear programs. Oper Res 34: 250–256CrossRefGoogle Scholar
  22. Schuurman P, Wöginger GJ (2001) Approximation Schemes—A Tutorial. Research Report Woe-65, CS Department, TU Graz, AustriaGoogle Scholar

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.Computer and Automation Research InstituteBudapestHungary

Personalised recommendations