Scheduling by positional completion times: Analysis of a two-stage flow shop problem with a batching machine

Mathematical Programming, Series B

Volumn 82, Issue 1-2, 1998, Pages 273-289

  Hoogeveen, Han ^a   Van De Velde, Steef ^b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b ERASMUS UNIVERSITY   (Netherlands)

Author keywords

Batching; Flow shop scheduling; Lagrangian relaxation; Machine scheduling problems; Mathematical formulation; Positional completion times; Total completion time

Indexed keywords

EID: 0013276232     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01585876     Document Type: Article

References (5)

1. J.H. Ahmadi, R.H. Ahmadi, S. Dasu, C.S. Tang, Batching and scheduling jobs on batch and discrete processors, Operations Research 40 (1992) 750-763.
2. J.A. Hoogeveen, T. Kawaguchi, Minimizing total completion time in a two-machine flowshop: Analysis of special cases, in: Proceedings of the Fifth International IPCO conference, Lecture Notes in Computer Science, vol. 1084, Springer, Berlin, 1996, pp. 374-388.
3. J.B. Lasserre, M. Queyranne, Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling, in: E. Balas, G. Cornuéjols, R. Kannan (Eds.), Proceedings of the Second Conference on Integer Programming and Combinatorial Optimization, Carnegie Mellon University, Pittsburgh, 1992, pp. 136-149.
4. J.A. Hoogeveen, H. Oosterhout, S.L. van de Velde, New lower and upper bounds for scheduling around a small common due date, Operations Research 42 (1994) 102-110.
5. W.E. Smith, Various optimizers for single-stage production, Naval Research Logistics Quarterly 3 (1956) 59-66.