Abstract
We present a new type of formulation for scheduling problems where jobs are identical in all aspects but one. This type of formulation is particularly useful for deriving Lagrangian lower and upper bounds for flowshop problems, where the jobs only differ in their processing times. We illustrate the effectiveness of this type of formulation for a two-machine flowshop problem where the first machine is a batching machine.
Supported by a grant from Netherlands Organization for Scientific Research (NWO)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ahmadi, J.H., Ahmadi, R.H., Dasu, S., Tang, C.S.: Batching and scheduling jobs with batch and discrete processors. Operations Research 39 (1992) 750–763
Hall, N.G.: Scheduling problems with generalized due dates. IIE Transactions (1986) 220–222
Hoogeveen, J.A., Kawaguchi, T.: Minimizing total completion time in a two-machine flowshop: analysis of special cases (unpublished report)
Hoogeveen, J.A., Oosterhout, H., Van de Velde, S.L.: New lower and upper bounds for scheduling around a small common due date. Operations Research 42 (1994) 102–110
Hoogeveen, J.A., Van de Velde, S.L.: Stronger Lagrangian bounds by use of slack variables: appications to machine scheduling problems. Mathematical Programming (to appear)
Lasserre, J.B., Queyranne, M.: Generic scheduling polyhedra and a new mixed-integer formulation for single-machine scheduling. Proceedings of the Third Conference on Integer Programming and Combinatorial Optimization, Carnegie Mellon (1992)
Müller, R., Schulz, A.S.: The interval order polytope of a digraph. Working Paper, TU Berlin (1994).
Potts, C.N.: A Lagrangean based branch-and-bound algorithm for single machine sequencing with precedence constraints to minimize total weighted completion time. Management Science 31 (1985) 1300–1311
Queyranne, M., Wang, Y.: Single-machine scheduling polyhedra with precedence constraints. Mathematics of Operations Research 16 (1991) 1–20
Queyranne, M., Wang, Y.: A cutting plane procedure for precedence-constrained single machine scheduling. Working Paper, University of British Columbia, Vancouver, Canada (1991)
Smith, W.E.: Various optimizers for single-stage production. Naval Research Logistics Quarterly 3 (1956) 59–66
Van de Velde, S.L.: Dual decomposition of a single-machine scheduling problem. Mathematical Programming (to appear)
Wolsey, L.A.: Formulating single machine polyhedra with precedence constraints. In Economic Decision-Making: Games, Econometrics and Optimization, eds. Gabszewicsz, J., Richard, J.-F., and Wolsey, L.A., North-Holland, Amsterdam (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hoogeveen, H., van de Velde, S. (1995). Formulating a scheduling problem with almost identical jobs by using positional completion times. In: Balas, E., Clausen, J. (eds) Integer Programming and Combinatorial Optimization. IPCO 1995. Lecture Notes in Computer Science, vol 920. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59408-6_59
Download citation
DOI: https://doi.org/10.1007/3-540-59408-6_59
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59408-6
Online ISBN: 978-3-540-49245-0
eBook Packages: Springer Book Archive