Abstract
The main motivation of this study is to provide, for the first time, a formulation and solution for a class of production scheduling problems (as in cluster tools) characterized mainly by resource collaboration to perform an operation and while allowing batches and considering alternative production methods. We develop a formulation for the new problem and term it a multiple mode per operation, resource collaboration, and constrained scheduling problem (MRCCSP). Some of the important new characteristics we consider are: multiple products (families); multiple orders (jobs) per family; precedence restrictions among the operations that constitute a job; alternative modes for the performance of an operation (each of which needs a set of collaborating resources) may be defined; complementary and exclusive restrictions between operation-modes; batch production is allowed; and setup times may depend on sequence and batch-size. The objective of the MRCCSP is to minimize makespan. We formulate the MRCCSP as a mixed integer linear programming model, and acknowledging the considerable size of the monolithic formulation required, we prescribe a specific method to achieve size reduction. Finally, a customized branch and bound algorithm for optimally solving this problem is proposed and examined experimentally.
Similar content being viewed by others
References
Agnetis, A., Pacciarelli, D., & Rossi, F. (1997). Batch scheduling in a two-machine flow shop with limited buffer. Discrete Applied Mathematics, 72, 243–260.
Ainbinder, I., Pinto, G., Rabinowitz, G., & Ben-Dov, Y. T. (2006). A customized branch and bound algorithm to solve a resource-sharing and scheduling problem. In Proceedings of the 4th IEEE international conference on computational cybernetic (ICCC), Estonia.
Artigues, C., & Feillet, D. (2008). A branch and bound method for the job-shop problem with sequence-dependent setup times. Annals of Operations Research, 159, 135–159.
Azizoglu, M., & Webster, S. (2000). Scheduling a batch processing machine with non-identical job sizes. International Journal of Production Research, 38(10), 2173–2184.
Bostrom, N. (2003). When machines outsmart humans. Futures, 35, 759–764.
Brucker, P., Drexl, A., Möhring, R., Neumann, K., & Pesch, E. (1999). Resource-constrained project scheduling: notation, classification, models and methods. European Journal of Operational Research, 112, 3–41.
Brucker, P., Knust, S., Schoo, A., & Thiele, O. (1998). A branch and bound algorithm for the resource-constrained project scheduling problem. European Journal of Operational Research, 107, 272–288.
Chen, J. S. (2006). A branch and bound procedure for the reentrant permutation flow-shop scheduling problem. The International Journal of Advanced Manufacturing Technology, 29, 1186–1193.
Crauwels, H. A. J., Potts, C. N., Van Oudheusden, D., & Van Wassenhove, L. N. (2005). Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs. Journal of Scheduling, 8, 161–177.
Das, S. R., & Canel, C. (2005). An algorithm for scheduling batches of parts in a multi-cell flexible manufacturing. International Journal of Production Economics, 97, 247–262.
Dawande, M., Geismar, H. N., Sethi, S. P., & Sriskandarajah, C. (2005). Sequencing and scheduling in robotic cells: recent developments. Journal of Scheduling, 8, 387–426.
Dorndorf, U., Pesch, E., & Phan Huy, T. (2000). A time-oriented branch-and-bound algorithm for resource-constrained project scheduling with generalized precedence constraints. Management Science, 46, 1365–1384.
Dümmler, M. (2004). Modeling and optimization of cluster tools in semiconductor manufacturing. PhD thesis, Department of Computer Science. University of Würzburg, Germany.
Elmaghraby, S. E. (1977). Activity network: project planning and control by network models. New York: Wiley.
Graves, S. C., Meal, H. C., Stefek, D., & Zeeghmi, A. H. (1983). Scheduling of re-entrant flow shops. Journal of Operations Management, 3(4), 197–207.
Gupta, J. N. D., Hariri, A. M. A., & Potts, C. N. (1997). Scheduling a two stage hybrid shop with parallel machines at the first stage. Annals of Operations Research, 69, 171–191.
Hartmann, S., & Briskorn, D. (2010). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, 207, 1–14.
Hartmann, S., & Drexl, A. (1998). Project scheduling with multiple modes: a comparison of exact algorithms. Networks, 32, 283–297.
Hooker, J. N. (2006). An integrated method for planning and scheduling to minimize tardiness. Constraints, 11(3), 139–157.
Hwan-Yong, L., & Tae-Eog, L. (2006). Scheduling single-armed cluster tools with reentrant wafer flows. IEEE Transactions on Semiconductor Manufacturing, 19(2), 226–240.
Karmarkar, N. (1984). A new polynomial time algorithm for linear programming. Combinatorica, 4(4), 373–395.
Kellere, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problem. Berlin: Springer.
Lin, S. W., Lee, Z. J., Ying, K. C., & Lin, R. H. (2011). Meta-heuristic algorithms for wafer sorting scheduling problems. Journal of the Operational Research Society, 62, 165–174.
Maimon, O. Z., & Nof, S. Y. (1985). Coordination of robots sharing assembly tasks. Journal of Dynamic Systems, Measurement, and Control, 107, 299–307.
Mehta, S. V., & Uzsoy, R. (1998). Minimizing total tardiness on a batch processing machine with incompatible job families. IIE Transactions, 30, 165–178.
Mendes, J. J. M., Goncalves, J. F., & Resende, M. G. C. (2009). A random key based genetic algorithm for the resource constrained project scheduling problem. Computers & Operations Research, 36(1), 92–109.
Mingozzi, A., Maniezzo, V., Ricciardelli, S., & Bianco, L. (1998). An exact algorithm for project scheduling with resource constraints based on a new mathematical formulation. Management Science, 44, 714–772.
Monch, L., Fowler, J. W., Dauzere-Peres, S., Mason, S. J., & Rose, O. (2011). A survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583–599.
Naiqi, W., Chengbin, C., Feng, C., & Meng, C. Z. (2008). A Petri net method for schedulability and scheduling problems in single-arm cluster tools with wafer residency time constraints. IEEE Transactions on Semiconductor Manufacturing, 21(2), 224–237.
Obeid, A., Dauzere-Peres, S., & Yugma, C. (2012). Scheduling job families on non-identical parallel machines with time constraints. Annals of Operations Research. doi:10.1007/s10479-012-1107-4.
Patterson, J. H., Sowinski, R., Talbot, F. B., & Weglarz, J. (1989). An algorithm for a general class of precedence and resource-constrained scheduling problems. In R. Sowinski & J. Weglarz (Eds.), Advances in project scheduling, Amsterdam: Elsevier.
Pinedo, M. (2008). Scheduling theory, algorithms and systems (3rd ed.). New York: Springer.
Pinedo, M. (2009). Planning and scheduling in manufacturing and services (2nd ed.). New York: Springer.
Pinto, G. (2009). Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP). PhD thesis, Department of Industrial Engineering and Management, Ben-Gurion University of the Negev, Beer-Sheva, Israel.
Pinto, G., Ainbinder, I., & Rabinowitz, G. (2009). A genetic algorithm-based approach for solving the resource sharing and scheduling problem. Computers & Industrial Engineering, 57(3), 1131–1143.
Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: a review. European Journal of Operational Research, 120, 228–249.
Rabinowitz, G., Mehrez, A., & Samaddar, S. (1991). Scheduling model for multi-robot assembly cells. International Journal of Flexible Manufacturing Systems, 3, 149–180.
Riane, F., Artiba, A., & Iassinovski, S. (2001). An integrated production planning and scheduling system for hybrid flowshop organizations. International Journal of Production Economics, 74, 33–48.
Sabzehparvar, M. (2008). A mathematical model for the multi-mode resource-constrained project scheduling problem with mode dependent time lags. Journal of Supercomputing, 44(3), 257–273.
Samaddar, S., Rabinowitz, G., & Mehrez, A. (1999). Resource sharing and scheduling for cyclic production in a computer-integrated manufacturing cell. Computers & Industrial Engineering, 36(3), 525–547.
Samaddar, S., Rabinowitz, G., & Zhang, G. P. (2005). An experimental analysis of solution performance in a resource sharing and scheduling problem. European Journal of Operational Research, 165, 139–156.
Sawik, T. (2002). Monolithic vs. hierarchical balancing and scheduling of a flexible assembly line. European Journal of Operational Research, 143, 115–124.
Sawik, T. (2004). Loading and scheduling of a flexible assembly system by mixed integer programming. European Journal of Operational Research, 154, 1–19.
Schneeweiss, C. (1999). Hierarchies in distributed decision making. Berlin: Springer.
Shanker, K., & Modi, B. K. (1999). A branch and bound based heuristic for multi-product resource constrained scheduling problem in FMS environment. European Journal of Operational Research, 113, 80–90.
Sherali, H. D., & Driscoll, P. J. (2000). Evolution and state-of-the-art in integer programming. Journal of Computational and Applied Mathematics, 124(1), 318–340.
Sprecher, A., & Drexl, A. (1999). Minimal delaying alternatives and semi-active timetabling in resource-constrained project scheduling. Management Science, 45, 452–454.
Tseng, L. Y., & Chen, S. C. (2009). Two-phase genetic local search algorithm for the multimode resource-constrained project scheduling problem. IEEE Transactions on Evolutionary Computation, 13(4), 848–857.
Weglarz, J., Jozefowska, J., Mika, M., & Waligora, G. (2011). Project scheduling with finite or infinite number of activity processing modes—a survey. European Journal of Operational Research, 208, 177–205.
Yazid, M., & Xiaolan, X. (2008). A genetic-search-guided greedy algorithm for multi-resource shop scheduling with flexibility. IIE Transactions, 40, 1228–1240.
Author information
Authors and Affiliations
Corresponding author
Appendix: MRCCSP notations
Appendix: MRCCSP notations
Indices:
Parameters:
Notice that the following sets used here, R, R i,m , R un , R ba , S f , F, are defined later.
Sets:
Decision variables:
MRCCSP size reduction constraints—reduced constraints are listed below
Rights and permissions
About this article
Cite this article
Pinto, G., Ben-Dov, Y.T. & Rabinowitz, G. Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP). Ann Oper Res 206, 311–339 (2013). https://doi.org/10.1007/s10479-012-1256-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-012-1256-5