One-Operator, Two-Machine Open Shop And Flow Shop Scheduling With Setup Times For Machines And Maximum Lateness Objective

References

• Aneja. Y.P. and N. Singh, 1990, “Scheduling production of common components at a single facility,” IIE Transactions. 22. 3, 234–237.
   Google Scholar
• Baker, K.R., 1988, “Scheduling the production of components at a common facility”. IIE Transactions, 20, 32–36.
   Google Scholar
• Baker, K.R. and M.J. Magazine, 1994. “Scheduling groups of jobs to minimize maximum lateness”, ORSA/TIMS meeting, Detroit.
   Google Scholar
• Bedworth, D.D. and J.E. Bailey, 1987. integrated Production Control Systems: Management, Analysis, Design, 2nd ed., Wiley, 1987.
   Google Scholar
• Bruno, J. and P. Downey. 1978. “Complexity of task sequencing with deadlines, setup times and changeover costs”. SIAM Journal of Compta., 7, 393–404.
   Google Scholar
• Cheng, T.C.E. and G. Wang. 1998. “A note on scheduling alternative operations in two-machine flow shops”. Journal of the Operational Research Society, 49, 670–673.
   Google Scholar
• Coffman, E.G., Jr., A. Nozari and M. Yannakakis, 1989, “Optimal scheduling of products with two subassemblies on a single machine.” Operations Research, 37, 426–436.
   Google Scholar
• Coffman. E.G., Jr., M. Yannakakis. M.J. Magazine and C. Santos. 1990. “Batch sizing and job sequencing on a single machine.” Annals of Operations Research, 26, 135–147.
   Google Scholar
• Ding, F.Y., 1990, “A pairwise interchange solution procedure for a scheduling problem with production of components at a single facility,” Computers & Industrial Engineering, 18. 325–331.
   Google Scholar
• French. S., 1982. Sequencing and Scheduling. Ellis Horwood, Chichester. England.
   Google Scholar
• Gerodimos, A.E., C.A. Glass C.N. Potts and T. Tautenhahn. 1999, “Scheduling multi-operation jobs on a single machine,” Annals of Operations Research. 92, 87–105.
   Google Scholar
• Gerodimos, A.E., C.A. Glass and C.N. Potts, 2000, “Scheduling the production of two-componenl jobs on a single machine,” European Journal of Operational Research, 120,. 250–259.
   Google Scholar
• Ghosh. J.B. and J.N.D. Gupta. 1997. “Batch scheduling to minimize maximum lateness”, Operations Research Letters. 21, 77–80.
   Google Scholar
• Gupta, J.N.D., J.C. Ho and J.A.A. van der Veen, 1997. “Single-machine hierarchical scheduling with customer orders and multiple job classes”. Annals of Operations Research. 70, 127–143.
   Google Scholar
• Hariri, A.M.A. and C.N. Potts, 1997, “Single-machine scheduling with hatch setup times to minimize maximum lateness,” Annals of Operations Research. 70, 75–92.
   Google Scholar
• Hochbaum, D. and D. Landy, 1994, “Scheduling with batching: minimizing the weighted number Of tardy jobs. Operations Research Letters, 16, 79–86.
   Google Scholar
• Julien, F.M., 1991. Scheduling Customer Orders, Ph.D. thesis, Department of Management Sciences, University of Waterloo.
   Google Scholar
• Julien, F.M. and M.J. Magazine. 1990. “Scheduling customer orders: an alternative production scheduling approach,” Journal of Manufacturing and Operations Management, 3, 177–199.
   Google Scholar
• Lee, E.J. and P.B. Mirchandani, 1988, “Concurrent routing, sequencing, and setups lor a two-machine flexible manufacturing cell”. IEEE Journal of Robotics and Automation. 4, 256–264.
   Google Scholar
• Monma, C.L. and C.N. Potts, 1989. “On the complexity of scheduling with batch setup times”. Operations Research. 37. 798–804.
   Google Scholar
• Pan, C.H. and J.S. Chen. 1998. “Scheduling alternative operations in two-machine flow shops”. Journal of the Operational Research Society, 48, 533–540.
   Google Scholar
• Potts, C.N. and M.Y. Kovalyov. 2000, “Scheduling with batching: a review.” European Journal of Operational Research. 120, 228–249.
   Google Scholar
• Potts, C.N. and L.N. Van Wassenhove. 1992, “Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity”. Journal of the Operational Research Society, 43, 395–406.
   Google Scholar
• Rana, S.P. and N. Singh, 1994, “Group scheduling jobs on a single machine: a multi-objective approach with preemptive priority structure,” European Journal oj Operational Research, 79, 38–50.
   Google Scholar
• Santos, C. and M. Magazine, 1985, “Batching in single-operation manufacturing systems”. Operations Research Letters. 4, 99–103.
   Google Scholar
• Schutten, J.M.J, S.L. van de Velde and W.H.M. Zijm. 1996. “’Single-machine scheduling with release dates, due dates and family setup times”. Management Science. 42, 1165–1174.
   Google Scholar
• Sung, C.S. and C.K. Park, 1993, “Scheduling of products with common and product-dependent components manufactured at a single facility”. Journal of the Operational Research Society, 44, 773–784.
   Google Scholar
• Unal, A.T. and A.S. Kiran, 1992. “Batch Sequencing”. IIE Transactions. 24, 73–83.
   Google Scholar
• Vickson. R.G., M.J. Magazine and C.A. Santos, 1993, “Batching and Sequencing of Components at a single facility”. IIE transactions. 25, 65–70.
   Google Scholar
• Woeginger, G.J., 1998. “A polynomial time approximation scheme for single-machine sequencing with delivery times and sequence independent batch setup times.” Journal of Scheduling, 1. 79–87.
   Google Scholar
• Webster. S. and K.R. Baker. 1995. “Scheduling groups of jobs on a single machine”. Operations Research. 43, 692–703.
   Google Scholar
• Zdrzalka, S., 1995, “Analysis of approximation algorithms for single machine scheduling with delivery times and sequence independent batch setup times,” European Journal of Operational Research. 80, 371–380.
   Google Scholar