Abstract
This paper considers the scheduling of job families on parallel machines with time constraints on machine qualifications. In this problem, each job belongs to a family and a family can only be executed on a subset of qualified machines. In addition, machines can lose their qualifications during the schedule. Indeed, if no job of a family is scheduled on a machine during a given amount of time, the machine loses its qualification for this family. The goal is to minimize the sum of job completion times, i.e. the flow time, while maximizing the number of qualifications at the end of the schedule. The paper presents a new Constraint Programming (CP) model taking more advantages of the CP feature to model machine disqualifications. This model is compared with two existing models: an Integer Linear Programming (ILP) model and a Constraint Programming model. The experiments show that the new CP model outperforms the other model when the priority is given to the number of disqualifications objective. Furthermore, it is competitive with the other model when the flow time objective is prioritized.
Grenoble INP—Institute of Engineering Univ. Grenoble Alpes.
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
Similar content being viewed by others
References
Beldiceanu, N., Carlsson, M., Rampon, J.X.: Global constraint catalog (revision a), January 2012
Cai, Y., Kutanoglu, E., Hasenbein, J., Qin, J.: Single-machine scheduling with advanced process control constraints. J. Sched. 15(2), 165–179 (2012). https://doi.org/10.1007/s10951-010-0215-8
IBM: IBM ILOG CPLEX Optimization Studio (2019). https://www.ibm.com/products/ilog-cplex-optimization-studio
Jedidi, N., Sallagoity, P., Roussy, A., Dauzère-Pérès, S.: Feedforward run-to-run control for reduced parametric transistor variation in CMOS logic 0.13 \(\upmu {\rm m}\) technology. IEEE Trans. Semicond. Manufact. 24(2), 273–279 (2011)
Laborie, P., Rogerie, J.: Reasoning with conditional time-intervals. In: Proceedings of the Twenty-First International Florida Artificial Intelligence Research Society Conference, Coconut Grove, Florida, USA, 15–17 May 2008, pp. 555–560 (2008). http://www.aaai.org/Library/FLAIRS/2008/flairs08-126.php
Laborie, P., Rogerie, J., Shaw, P., Vilím, P.: Reasoning with conditional time-intervals. Part II: an algebraical model for resources. In: Proceedings of the Twenty-Second International Florida Artificial Intelligence Research Society Conference, Sanibel Island, Florida, USA, 19–21 May 2009 (2009). http://aaai.org/ocs/index.php/FLAIRS/2009/paper/view/60
Li, L., Qiao, F.: The impact of the qual-run requirements of APC on the scheduling performance in semiconductor manufacturing. In: Proceedings of 2008 IEEE International Conference on Automation Science and Engineering(CASE), pp. 242–246 (2008)
Moench, L., Fowler, J.W., Dauzère-Pérès, S., Mason, S.J., Rose, O.: A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. J. Sched. 1–17 (2011). https://doi.org/10.1007/s10951-010-0222-9
Moyne, J., del Castillo, E., Hurwitz, A.M.: Run-to-Run Control in Semiconductor Manufacturing, 1st edn. CRC Press, Boca Raton (2000)
Musacchio, J., Rangan, S., Spanos, C., Poolla, K.: On the utility of run to run control in semiconductor manufacturing. In: Proceedings of 1997 IEEE International Symposium on Semiconductor Manufacturing Conference, pp. 9–12 (1997)
Nattaf, M., Dauzère-Pérès, S., Yugma, C., Wu, C.H.: Parallel machine scheduling with time constraints on machine qualifications, Manuscript submitted for publication
Nattaf, M., Obeid, A., Dauzère-Pérès, S., Yugma, C.: Méthodes de résolution pour l’ordonnancement de familles de tâches sur machines parallèles et avec contraintes de temps. In: 19ème édition du congrès annuel de la Société Française de Recherche Opérationnelle et d’Aide à la Décision, ROADEF2018
Obeid, A., Dauzère-Pérès, S., Yugma, C.: Scheduling job families on non-identical parallel machines with time constraints. Ann. Oper. Res. 213(1), 221–234 (2014). https://doi.org/10.1007/s10479-012-1107-4
Tan, F., Pan, T., Li, Z., Chen, S.: Survey on run-to-run control algorithms in high-mix semiconductor manufacturing processes. IEEE Trans. Ind. Inform. 11(6), 1435–1444 (2015)
Wolf, A.: Constraint-based task scheduling with sequence dependent setup times, time windows and breaks. GI Jahrestagung 154, 3205–3219 (2009)
Yugma, C., Blue, J., Dauzère-Pérès, S., Obeid, A.: Integration of scheduling and advanced process control in semiconductor manufacturing: review and outlook. J. Sched. 18(2), 195–205 (2015). https://doi.org/10.1007/s10951-014-0381-1
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Malapert, A., Nattaf, M. (2019). A New CP-Approach for a Parallel Machine Scheduling Problem with Time Constraints on Machine Qualifications. In: Rousseau, LM., Stergiou, K. (eds) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. CPAIOR 2019. Lecture Notes in Computer Science(), vol 11494. Springer, Cham. https://doi.org/10.1007/978-3-030-19212-9_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-19212-9_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19211-2
Online ISBN: 978-3-030-19212-9
eBook Packages: Computer ScienceComputer Science (R0)