×

Integration of lotsizing and scheduling decisions in a job-shop. (English) Zbl 0806.90062

Summary: We consider an integrated model for job-shop lotsizing and scheduling in order to determine a feasible plan, i.e., a plan with at least one feasible schedule. Our method consists in alternatively solving problems at two different levels, one in which lotsizes are computed for a given sequence of jobs on each machine, and one in which a sequence is computed given fixed lotsizes. Different approaches are investigated, and computational results are reported.

MSC:

90B35 Deterministic scheduling theory in operations research
90C10 Integer programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Adams, J.; Balas, E.; Zawack, D., The shifting bottleneck procedure for job shop scheduling, Management Science, 34, 391-401 (1988) · Zbl 0637.90051
[2] Baker, K. R., Introduction to Sequencing and Scheduling (1974), Wiley: Wiley New York
[3] Bitran, G. R.; Tirupati, D., Hierarchical production planning, (MIT Sloan School Working Paper No. 3017-89-MS (1989), Sloan School of Management, Massachusetts Institute of Technology: Sloan School of Management, Massachusetts Institute of Technology Cambridge, MA)
[4] Buxey, G., Production scheduling: Practice and theory, European Journal of Operational Research, 39, 17-31 (1989)
[5] Conway, R. W.; Maxwell, W. L.; Miller, L. W., Theory of Scheduling (1967), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 1058.90500
[6] Dauzère-Péres, S., Planification et ordonnancement de la production: Une approche integrée cohérente, (Thèse de Doctorat de l’Université Paul Sabatier (1992)), Rapport LAAS No. 92129, March 1992, Toulouse
[7] Dauzère-Péres, S.; Lasserre, J. B., A modified shifting bottleneck procedure for job-shop scheduling, International Journal of Production Research, 31, 923-932 (1993) · Zbl 0773.90036
[8] Elmaghraby, S. E., The Economic Lot Scheduling Problem (ELSP): Review and extensions, Management Science, 24, 587-598 (1978) · Zbl 0376.90051
[9] Fisher, H.; Thompson, G. L., Probabilistic learning combinations of local job-shop scheduling rules, (Muth, J. F.; Thompson, G. L., Industrial Scheduling (1963), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ), 225-251
[10] Fontan, G.; Imbert, S., Interaction between the two levels of decision making in a job shop, (presented at Congrès EURO VI. presented at Congrès EURO VI, Bologne, 1985 (1985))
[11] Lasserre, J. B., An integrated model for job-shop planning and scheduling, Management Science, 38, 1201-1211 (1992) · Zbl 0761.90062
[12] Lenstra, J. K.; Rinnooy Kan, A. H.G., New directions in scheduling theory, Operations Research Letters, 6, 255-259 (1984) · Zbl 0528.90047
[13] Potts, C. N.; Van Wassenhove, L. N., Integrating scheduling batching and lot-sizing: A review of algorithms and complexity, Journal of the Operational Research Society, 43, 395-406 (1992) · Zbl 0756.90050
[14] Roy, B.; Sussman, B., Les problèmes d’ordonnancement avec contraintes disjonctives (1964), SEMA: SEMA Montrouge, Note DS No. 9 bis
[15] Zipkin, P. H., Computing optimal lot sizes in the Economic Lot Scheduling Problem, Operational Research, 39, 56-63 (1991) · Zbl 0747.90033
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.