Abstract
Many scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules considering the manufacturing cost implications in response to disruptions. We consider a non-identical parallel machining environment where processing times of the jobs are compressible at a certain manufacturing cost, which is a convex function of the compression on the processing time. In rescheduling it is highly desirable to catch up the original schedule as soon as possible by reassigning the jobs to the machines and compressing their processing times. On the other hand, one must also keep the manufacturing cost due to compression of the jobs low. Thus, one is faced with a tradeoff between match-up time and manufacturing cost criteria.
We introduce alternative match-up scheduling problems for finding schedules on the efficient frontier of this time/cost tradeoff. We employ the recent advances in conic mixed-integer programming to model these problems effectively. We further provide a fast heuristic algorithm driven by dual prices of convex subproblems for generating approximate efficient schedules.
Article PDF
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Avoid common mistakes on your manuscript.
References
Aktürk, M. S., & Görgülü, E. (1999). Match-up scheduling under a machine breakdown. European Journal of Operational Research, 112, 81–97.
Aktürk, M. S., Atamtürk, A., & Gürel, S. (2009). A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Operations Research Letters, 37, 187–191.
Alizadeh, F., & Goldfarb, D. (2003). Second-order cone programming. Mathematical Programming, 95, 3–51.
Bean, J. C., Birge, J. R., Mittenthal, J., & Noon, C. E. (1991). Match-up scheduling with multiple resources, release dates and disruptions. Operations Research, 39(3), 470–483.
Ben-Tal, A., & Nemirovski, A. (2001). Lectures on modern convex optimization: analysis, algorithms, and engineering applications. Philadelphia: SIAM.
Bretthauer, K. M., & Shetty, B. (1995). The nonlinear resource allocation problem. Operations Research, 43(4), 670–683.
Briand, C., La, H. T., & Erschler, J. (2007). A robust approach for the single machine scheduling problem. Journal of Scheduling, 10(3), 209–221.
Gürel, S., & Aktürk, M. S. (2007). Optimal allocation and processing time decisions on parallel CNC machines: ε-constraint approach. European Journal of Operational Research, 183, 591–607.
Jensen, M. T. (2001). Improving robustness and flexibility of tardiness and total flow-time job shops using robustness measures. Applied Soft Computing, 1, 35–52.
Kayan, R. K., & Aktürk, M. S. (2005). A new bounding mechanism for the CNC machine scheduling problems with controllable processing times. European Journal of Operational Research, 167, 624–643.
Leus, R., & Herroelen, W. (2007). Scheduling for stability in single-machine production. Journal of Scheduling, 10(3), 223–235.
Mehta, S. V., & Uzsoy, R. M. (1998). Predictable scheduling of a job shop subject to breakdowns. IEEE Transactions on Robotics and Automation, 14, 365–378.
Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643–1666.
T’kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling: theory, models and algorithms (2nd ed.). Berlin: Springer.
Vieira, G. E., Herrmann, J. W., & Lin, E. (2003). Rescheduling manufacturing systems: A framework of strategies, policies and methods. Journal of Scheduling, 6, 39–62.
Yedidsion, L., Shabtay, D., & Kaspi, M. (2007). A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. Journal of Scheduling, 10, 341–352.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Aktürk, M.S., Atamtürk, A. & Gürel, S. Parallel machine match-up scheduling with manufacturing cost considerations. J Sched 13, 95–110 (2010). https://doi.org/10.1007/s10951-009-0111-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-009-0111-2