Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops

References

• Albers S., Brucker P. The complexity of one-machine batching problems. Discrete Applied Mathematics (1993) 47:87–107Crossref, Google Scholar
• Brucker P., Kovalyov M.Y. Single machine batch scheduling to minimize the weighted number of late jobs. Mathematical Methods of Operations Research (1996) 43:1–8Crossref, Google Scholar
• Cheng T.C.E., Chen Z.-L., Kovalyov M.Y., Lin B.M.T. Parallel-machine batching and scheduling to minimize total completion time. IIE Transactions (1996) 28:953–956Crossref, Google Scholar
• Cheng T.C.E., Kovalyov M.Y.Single machine batch scheduling with sequential job processing (1998a) (Departement of Management, Polytechnic University, Hong Kong) . Annual Research ReportGoogle Scholar
• Cheng T.C.E., Kovalyov M.Y.Algorithms for parallel machine batch scheduling with deadlines (1998b) (Departement of Management, Polytechnic University, Hong Kong) . Annual Research ReportGoogle Scholar
• Cheng T.C.E., Wang G. Batching and scheduling to minimize the makespan in the two-machine flowshop. IIE Transactions (1998) 30:447–453Crossref, Google Scholar
• Garey M.R., Johnson D.S.Computers and Intractability. A Guide to The Theory of NP-Completeness (1979) (Freeman, San Francisco, CA) Google Scholar
• Gonzalez T., Sahni S. Open-shop schedules to minimize finish time. Journal of the Association for Computing Machinery (1976) 23:665–679Crossref, Google Scholar
• Graham R.L. Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics (1969) 17:416–429Crossref, Google Scholar
• Graham R.L., Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics (1979) 5:287–326Crossref, Google Scholar
• Hochbaum D.S., Landy D. Scheduling with batching: minimizing the weighted number of tardy jobs. Operations Research Letters (1994) 16:79–86Crossref, Google Scholar
• Johnson S.M. Optimal two- and three-stage production schedules with setup times included. Naval Research Logistics Quarterly (1954) 1:61–68Crossref, Google Scholar
• Karp R.M., Miller R.E., Thatcher J.W. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 85–103Crossref, Google Scholar
• Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., Shmoys D.B., Graves S.C., Rinnooy Kan A.H.G., Zipkin P.H. Sequencing and scheduling: algorithms and complexity. Handbooks in Operations Research and Management Science, Volume 4, Logistics of Production and Inventory (1993) (North-Holland, Amsterdam, The Netherlands) 455–522Google Scholar
• Potts C.N. Analysis of a linear-programming heuristic for scheduling unrelated parallel machines. Discrete Applied Mathematics (1985) 10:155–164Crossref, Google Scholar
• Potts C.N., Strusevich V.A., Tautenhahn T.Shop scheduling with batching machines (1998) (Faculty of Mathematical Studies, Southampton University, U.K.) . Preprint OR100Google Scholar
• Rothkopf M.H. Scheduling independent tasks on parallel processors. Management Science (1966) 12:437–447Link, Google Scholar
• Sahni S. Algorithms for scheduling independent tasks. Journal of the Association for Computing Machinery (1976) 23:116–127Crossref, Google Scholar
• Strusevich V.A. Two-machine open-shop scheduling problem with setup, processing and removal times separated. Computers & Operations Research (1993) 20:597–611Crossref, Google Scholar
• Webster S., Baker K.R. Scheduling groups of jobs on a single machine. Operations Research (1995) 43:692–703Link, Google Scholar
• Yoshida T., Hitomi K. Optimal two-stage production scheduling with setup times separated. AIIE Transactions (1979) 11:261–263Crossref, Google Scholar