ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling

References

• Adams J., Balas E., Zawack D. The shifting bottleneck procedure for job-shop scheduling. Management Sci. (1988) 34:391–401Link, Google Scholar
• Albin S. L. Approximating queues with superposition arrival processes. (1981) . Ph.D. thesis, Department for Industrial Engineering and Operations Research, Columbia UniversityGoogle Scholar
• Applegate D., Cook W. A computational study of the job-shop scheduling problem. ORSA J. Comput. (1991) 3:149–156Link, Google Scholar
• Balas E., Lenstra J. K., Vazacopoulos A. The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Sci. (1995) 41:94–109Link, Google Scholar
• Barnes W., Chambers J. Solving the job shop scheduling problem with tabu search. IIE Trans. (1995) 27:257–263Crossref, Google Scholar
• Bitran G. R., Tirupati D. Multiproduct queueing networks with deterministic routing: Decomposition approach and the notion of interference. Management Sci. (1988) 34:75–100Link, Google Scholar
• Bitran G. R., Tirupati D. Approximations for product departures from a single-server station with batch processing in multi-product queues. Management Sci. (1989) 35:851–878Link, Google Scholar
• Brucker P., Jurisch B., Sievers B. A branch-and-bound algorithm for the job-shop scheduling problem. Discrete Appl. Math. (1994) 49:107–127Crossref, Google Scholar
• Buzacott J. A., Shantikumar J. G. On approximate queueing models of dynamic job shops. Management Sci. (1985) 31:870–887Link, Google Scholar
• Carlier J. The one-machine scheduling problem. Eur. J. Oper. Res. (1982) 11:42–47Crossref, Google Scholar
• Carlier J., Pinson E. An algorithm for solving the job-shop problem. Management Sci. (1989) 35:164–176Link, Google Scholar
• Dauzere-Péres S., Lasserre J. B. A modified shifting bottleneck procedure for job-shop scheduling. Internat. J. Production Res. (1993) 31:923–932Crossref, Google Scholar
• Ivens P. L., Lambrecht M. R. Extending the shifting bottleneck procedure to real-life applications. Eur. J. Oper. Res. (1996) 90:252–268Crossref, Google Scholar
• Karmarkar. U.S. Lot sizes, lead times and in-process inventories. Management Sci. (1987) 33:409–423Link, Google Scholar
• Kraemer W., Lagenbach-Belz M. Approximate formulae for the delay in the queueing system. GI/GI/1 Congressbook (1976) . Eighth International Teletraffic Congress, Melbourne 235-1/8Google Scholar
• Lambrecht M. R., Shaoxiang Chen, Vandaele N. J. A lot sizing model with queueing delays. The issue of safety time. Eur. J. Oper. Res. (1996) 89:269–276Crossref, Google Scholar
• Lambrecht M. R., Vandaele N. J. A general approximation for the single product lot sizing model with queueing delays. Eur. J. Oper. Res. (1996) 95:73–88Crossref, Google Scholar
• Ovacik I. M., Uzoy R.Decomposition Methods for Complex Factory Scheduling Problems (1996) (Kluwer Academic Publishers)Google Scholar
• Schutten J. M. J., Van de Velde S. L., Zijm W. H. Single machine scheduling with release dates, due dates and family setup times. Management Sci. (1996) 42:1165–1174Link, Google Scholar
• Shantikumar J. G., Buzacott J. A. On the approximations to the single server queue. Internat. J. Production Res. (1980) 18:761–773Crossref, Google Scholar
• Shantikumar J. G., Buzacott J. A. Open queueing network models of dynamic job shops. Internat. J. Production Res. (1981) 19:255–266Crossref, Google Scholar
• Shantikumar J. G., Sumita U. Approximations for the time spent in a dynamic job shop with applications to due-date assignment. Internat. J. Production Res. (1988) 26:1329–1352Crossref, Google Scholar
• Suri R., DeTreville S. Rapid modelling: The use of queueing models to support time based competitive manufacturing. Proc. German/US Conf. on Recent Developments in Operations Research (1992) (Springer, Berlin) 34–42Google Scholar
• Vandaele N. J. The impact of lot sizing on queueing delays: Multi product, multi machine models. (1996) . Ph.D. thesis, Department of Applied Economics, Katholieke Universiteit Leuven, BelgiumGoogle Scholar
• Wein L. M., Chevalier P. B. A broader view of the job shop scheduling problem. Management Sci. (1992) 38:1018–1033Link, Google Scholar
• Whitt W. The queueing network analyzer. The Bell System Tech. J. (1983) 62:2779–2815Crossref, Google Scholar
• Zijm W. H. M., Buitenhek R. Capacity planning and lead time management. Internat. J. Production Econom. (1996) 46–47:165–179Crossref, Google Scholar