Complexity of single machine scheduling subject to nonnegative inventory constraints

European Journal of Operational Research

Volumn 207, Issue 2, 2010, Pages 605-619

  Briskorn, Dirk ^a,c   Choi, Byung Cheon ^b   Lee, Kangbok ^c   Leung, Joseph ^d   Pinedo, Michael ^c  

^a UNIVERSITY OF COLOGNE   (Germany)

^b Chungnam National University   (South Korea)

^c NEW YORK UNIVERSITY   (United States)

^d University Heights   (United States)

Author keywords

Computational complexity; Inventory constraints; Machine scheduling; Polynomial time algorithms; Strong NP hardness

Indexed keywords

INVENTORY CONSTRAINTS; MACHINE SCHEDULING; NP-HARDNESS; POLYNOMIAL-TIME ALGORITHMS; STRONG NP-HARDNESS;

HARDNESS; MACHINERY;

COMPUTATIONAL COMPLEXITY;

EID: 77955550944     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.05.036     Document Type: Article

References (20)

1. R. Ahuja, K. Mehlhorn, J. Orlin, and R. Tarjan Faster algorithms for the shortest path problem Journal of the Association for Computing Machinery 37 1990 213 223
2. J.-H. Bartels, and J. Zimmermann Scheduling tests in automotive R&D projects European Journal of Operational Research 193 3 2009 805 819
3. J.C. Beck Heuristics for scheduling with inventory: dynamic focus via constraint criticality Journal of Scheduling 5 2002 43 69
4. N. Boysen, M. Fliedner, and A. Scholl Scheduling inbound and outbound trucks at cross docking terminals OR Spectrum 32 2010 135 161
5. P. Brucker, S. Heitmann, and J. Hurink Flow shop scheduling with intermediate buffers OR Spectrum 25 2003 549 574
6. P. Brucker, S. Heitmann, J. Hurink, and T. Nieberg Job-shop scheduling with limited capacity buffers OR Spectrum 28 2006 151 176
7. J. Carlier, A. Moukrim, and H. Xu The project scheduling problem with production and consumption of resources: a list-scheduling based algorithm Discrete Applied Mathematics 157 2009 3631 3642
8. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimisation and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 1979 236 287
9. A. Grigoriev, M. Holthuijsen, and J.v.d. Klundert Basic scheduling problems with raw material constraints Naval Research Logistics 52 2005 527 535
10. R. Hassin Approximation schemes for the restricted shortest path problem Mathematics of Operations Research 17 1 1992 36 42
11. P. Laborie Algorithms for propagating resource constraints in ai planning and scheduling: existing approaches and new results Artificial Intelligence 143 2003 151 188
12. J. Lenstra, A. Rinnooy Kan, and P. Brucker Complexity of machine scheduling problems Annals of Discrete Mathematics 1 1977 343 362
13. D.L. McWilliams, P.M. Stanfield, and C.D. Geiger The parcel hub scheduling problem: a simulation-based solution approach Computers and Industrial Engineering 49 2005 393 412
14. K. Neumann, and C. Schwindt Project scheduling with inventory constraints Mathematical Methods of Operations Research 56 2002 513 533
15. K. Neumann, C. Schwindt, and N. Trautmann Scheduling of continuous and discontinuous material flows with intermediate storage restrictions European Journal of Operational Research 165 2005 495 509
16. E. Nowicki The permutation shop with buffers: a tabu search approach European Journal of Operational Research 116 1999 205 219
17. C.H. Papadimitriou, and P.C. Kanellakis Flow shop scheduling with limited temporary storage Journal of the Association for Computing Machinery 27 1980 533 549
18. C. Schwindt, and N. Trautmann Batch scheduling in process industries: an application of resource-constrained project scheduling OR Spectrum 22 4 2000 501 524
19. F. Sourd, and J. Rogerie Continuous filling and emptying of storage systems in constraint-based scheduling European Journal of Operational Research 165 2005 510 524
20. W. Yu, and P.J. Egbelu Scheduling of inbound and outbound trucks in cross docking systems with temporary storage European Journal of Operational Research 184 2008 377 396