Abstract
In this chapter, we extend the linear temporal decomposition approach developed in the previous chapter for workcenters consisting of a single machine with sequence-dependent setup times to workcenters with parallel identical machines (Ovacik and Uzsoy 1995). As was the case for the single-machine problems discussed in the previous chapter, these arise as subproblems in the workcenter-based decomposition procedure. Once again the operations arrive at the workcenter dynamically over time due to scheduling decisions made at other workcenters. These operation release times and due dates can be calculated using the graph representation of partial schedules at intermediate iterations of the shop decomposition procedure. We again assume that all operations are independent (an assumption we shall relax in Chapter 10), and refer to the individual operations to be scheduled as jobs for the sake of conciseness, keeping in mind that in the context of the job shop problem they are operations of jobs involving a number of such operations at different workcenters.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bitran, G.R., Gilbert, S.M., “Sequencing Production on Parallel Machines with Two Magnitudes of Sequence-Dependent Setup Cost”, Journal of Manufacturing and Operations Management 3, 24–52 (1990).
Cashier, J., “Scheduling Jobs with Release Times and Tails on Identical Machines to Minimize the Makespan”, European Journal of Operational Research 29, 298–306 (1987).
Garey, M.R., Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP Completeness, W.H. Freeman, San Francisco (1979).
Graham, R.L, “Bounds on Multiprocessor Timing Anomalies”, SIAM Journal of Applied Mathematics 17, 416429 (1969).
Gusfield, D., “Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines”, Journal of Algorithms 5, 1–6 (1984).
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., “Sequencing and Scheduling: Algorithms and Complexity”, in Handbooks in Operations Research and Management Science VoL4: Logistics of Production and Inventory, S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin (eds.), North-Holland (1993).
Masuda, T., Ishii, H., Nishida, T., “Some Bounds on Approximation Algorithms for n/m/1/Lmax and n/2/F/Lmax Scheduling Problems”, Journal of Operations Research Society of Japan 26, 212–224 (1983).
Monma, C., Potts, C.N., “Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times”, Operations Research 41, 981–993 (1993).
Ovacik, I.M., Uzsoy, R., “Worst-Case Error Bounds for Parallel Machine Scheduling Problems with Bounded Sequence-Dependent Setup Times”, Operations Research Letters 14, 251–256 (1993).
Ovacik, I.M., Uzsoy, R., “Rolling Horizon Procedures for Dynamic Parallel Machine Problems with Sequence Dependent Setup Times”, International Journal of Production Research 33, 3173–3192 (1995).
Parker, R.G., Deane, R.H., Holmes, R.A., “On the Use of a Vehicle Routing Algorithm for the Parallel Processor Problem with Sequence Dependent Change Over Costs”, ¡WE Transactions 9, 155–160 (1977).
Sahni, S., Gonzalez, T., “P-Complete Approximation Problems”, Journal of the Association for Computing Machinery 23, 555–565 (1976).
Schutten, J.M.J., “List Scheduling Revisited”, Operations Research Letters, (forthcoming).
Schutten, J.M.J., Leussink, R.A.M., “Parallel Machine Scheduling with Release Dates, Due Dates and Family Setup Times”, International Journal of Production Economics, (forthcoming).
Tang, C.S., “Scheduling Batches on Parallel Machines with Major and Minor Set-ups”, European Journal of Operations Research 46, 28–37 (1990).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Ovacik, I.M., Uzsoy, R. (1997). Time-Based Decomposition Procedures for Parallel Machine Subproblems with Sequence-Dependent Setup Times. In: Decomposition Methods for Complex Factory Scheduling Problems. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6329-7_8
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6329-7_8
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7906-5
Online ISBN: 978-1-4615-6329-7
eBook Packages: Springer Book Archive