Scheduling of unrelated parallel machines with limited server availability on multiple production locations: a case study in knitted fabrics

References

• Abdekhodaee, A. H., and A. Wirth. 2002. “Scheduling Parallel Machines with a Single Server: Some Solvable Cases and Heuristics.” Computers & Operations Research 29 (3): 295–315.
   Web of Science ®Google Scholar
• Abdekhodaee, A. H., A. Wirth, and H. S. Gan. 2004. “Equal Processing and Equal Setup Time Cases of Scheduling Parallel Machines with a Single Server.” Computers & Operations Research 31 (11): 1867–1889.
   Web of Science ®Google Scholar
• Abdekhodaee, A. H., A. Wirth, and H.-S. Gan. 2006. “Scheduling Two Parallel Machines with a Single Server: The General Case.” Computers & Operations Research 33 (4): 994–1009.
   Web of Science ®Google Scholar
• Abdullah, S. 2011. “Re-heat Simulated Annealing Algorithm for Rough Set Attribute Reduction.” International Journal of the Physical Sciences 6 (8): 2083–2089.
   Google Scholar
• Allahverdi, A., J. Gupta, and T. Aldowaisan. 1999. “A Review of Scheduling Research Involving Setup Considerations.” Omega The International Journal of Management Sciences 27: 219–239.
   Web of Science ®Google Scholar
• Allahverdi, A., C. Ng, T. Cheng, and M. Kovalyov. 2008. “A Survey of Scheduling Problems with Setup Times or Costs.” European Journal of Operational Research 187: 985–1032.
   Web of Science ®Google Scholar
• Anagnostopoulos, A., and L. Michel. 2006. “A Simulated Annealing Approach to the Traveling Tournament Problem.” Journal of Scheduling 9 (2): 177–193.
   Web of Science ®Google Scholar
• Arnaout, J.-P., G. Rabadi, and R. Musa. 2009. “A Two-stage Ant Colony Optimization Algorithm to Minimize the Makespan on Unrelated Parallel Machines with Sequence-dependent Setup Times.” Journal of Intelligent Manufacturing 21 (6): 693–701.
   Web of Science ®Google Scholar
• Balakrishnan, N., J. Kanet, and S. Sridharan. 1999. “Early/Tardy Scheduling with Sequence Dependent Setups on Uniform Parallel Machines.” Computers & Operations Research 26: 127–141.
   Web of Science ®Google Scholar
• Balasubramanian, H., L. Mönch, J. Fowler, and M. Pfund. 2004. “Genetic Algorithm Based Scheduling of Parallel Batch Machines with Incompatible Job Families to Minimize Total Weighted Tardiness.” International Journal of Production Research 42 (8): 1621–1638.
   Web of Science ®Google Scholar
• Behnamian, J., and S. F. Ghomi. 2013. “The Heterogeneous Multi-factory Production Network Scheduling with Adaptive Communication Policy and Parallel Machine.” Information Sciences 219: 181–196.
   Web of Science ®Google Scholar
• Behnamian, J., M. Zandieh, and S. Fatemi Ghomi. 2009. “Parallel-machine Scheduling Problems with Sequence-dependent Setup Times Using an ACO, SA and VNS Hybrid Algorithm.” Expert Systems with Applications 36 (6): 9637–9644.
   Web of Science ®Google Scholar
• Bilge, U., F. Kiraç, M. Kurtulan, and P. Pekgün. 2004. “A Tabu Search Algorithm for Parallel Machine Total Tardiness Problem.” Computers & Operations Research 31: 397–414.
   Web of Science ®Google Scholar
• Bunday, B. D., H. M. Bokhari, and E. Khorram. 1997. “The Efficiency of Two Groups of Heterogeneous Stations Cared for by r Operatives with a Priority Group.” Applied Mathematical Modelling 21 (1): 42–47.
   Web of Science ®Google Scholar
• Chen, B., C. N. Potts, and G. J. Woeginger. 1998. “A Review of Machine Scheduling: Complexity, Algorithms and Approximability.” Handbook of combinatorial optimization3: 21–169.
   Google Scholar
• Cheng, R., M. Gen, and T. Tozawa. 1995. “Minmax Earliness/Tardiness Scheduling in Identical Parallel Machine System using Genetic Algorithms.” Computers & Industrial Engineering 29 (1–4): 513–517.
   Web of Science ®Google Scholar
• Cheng, T. T., and C. C. Sin. 1990. “A State-of-the-art Review of Parallel-machine Scheduling Research.” European Journal of Operational Research 47 (January): 271–292.
   Web of Science ®Google Scholar
• Dai, M., D. Tang, K. Zheng, and Q. Cai. 2013. “An Improved Genetic-simulated Annealing Algorithm Based on a Hormone Modulation Mechanism for a Flexible Flow-shop Scheduling Problem.” Advances in Mechanical Engineering 2013: 1–13.
   Web of Science ®Google Scholar
• Fanjul-Peyro, L. , and R. Ruiz. 2010. “Iterated Greedy Local Search Methods for Unrelated Parallel Machine Scheduling.” European Journal of Operational Research207 (1): 55–69.
   Web of Science ®Google Scholar
• Franca, P., M. Gendreau, G. Laporte, and F. Muller. 1994. “A Composite Heuristic for the Identical Parallel Machine Scheduling Problem with Minimum Makespan Objective.” Computers and Operations Research 21 (2): 205–210.
   Web of Science ®Google Scholar
• Frostig, E. 1993. “Optimal Policies for Machine Repairmen Problems.” Journal of applied probability 30 (3): 703–715.
   Web of Science ®Google Scholar
• Gaver, D., J. Morrison, and R. Silveira. 1993. “Service-adaptive Multitype Repairman Problems.” SIAM Journal on Applied Mathematics 53 (2): 459–470.
   Web of Science ®Google Scholar
• Gendreau, M., G. Laporte, and E. Guimaraes. 2001. “A Divide and Merge Heuristic for the Multiprocessor Scheduling Problem with Sequence Dependent Setup Times.” European Journal of Operational Research 133: 183–189.
   Web of Science ®Google Scholar
• Glass, C. A., Y. M. Shafransky, and V. A. Strusevich. 2000. “Scheduling for Parallel Dedicated Machines with a Single Server.” Naval Research Logistics 47 (4): 304–328.
   Web of Science ®Google Scholar
• Glover, F. and G. A. Kochenberger. 2003. Handbook of Metaheuristics. Boston, MA: Springer.
   Google Scholar
• Graham, R., E. Lawler, J. Lenstra, and A. Rinnooy Kan. 1979. “Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey.” Annals of Discrete Mathematics 5: 287–326.
   Google Scholar
• Hall, N., and M. Posner. 2001. “Generating Experimental Data for Computational Testing with Machine Scheduling Applications.” Operations Research 49: 854–865.
   Web of Science ®Google Scholar
• Hall, N. G., C. N. Potts, and C. Sriskandarajah. 2000. “Parallel Machine Scheduling with a Common Server.” Discrete Applied Mathematics 102 (3): 223–243.
   Web of Science ®Google Scholar
• Haque, L., and M. J. Armstrong. 2007. “A Survey of the Machine Interference Problem.” European Journal of Operational Research 179 (2): 469–482.
   Web of Science ®Google Scholar
• Heady, R., and Z. Zhu. 1998. “Minimizing the Sum of Job Earliness and Tardiness in a Multimachine System.” International Journal of Production Research 36: 1619–1632.
   Web of Science ®Google Scholar
• Holland, J. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.
   Google Scholar
• Huang, S., L. Cai, and X. Zhang. 2010. “Parallel Dedicated Machine Scheduling Problem with Sequence-dependent Setups and a Single Server.” Computers & Industrial Engineering 58 (1): 165–174.
   Web of Science ®Google Scholar
• Hurink, J., and S. Knust. 2001. “List Scheduling in a Parallel Machine Environment with Precedence Constraints and Setup Times.” Operations Research Letters 29 (5): 231–239.
   Web of Science ®Google Scholar
• Iravani, S. M., I. Duenyas, and T. L. Olsen. 2000. “A Production/Inventory System Subject to Failure with Limited Repair Capacity.” Operations Research 48 (6): 951–964.
   Web of Science ®Google Scholar
• Jou, C. 2005. “A Genetic Algorithm with Sub-indexed Partitioning Genes and its Application to Production Scheduling of Parallel Machines.” Computers & Industrial Engineering 48 (1): 39–54.
   Web of Science ®Google Scholar
• Kim, M.-Y., and Y. H. Lee. 2012. “MIP Models and Hybrid Algorithm for Minimizing the Makespan of Parallel Machines Scheduling Problem with a Single Server.” Computers & Operations Research 39 (11): 2457–2468.
   Web of Science ®Google Scholar
• Kim, S. I., H. S. Choi , and D. H. Lee. 2006. “Tabu Search Heuristics for Parallel Machine Scheduling with Sequence-dependent Setup and Ready Times.” In Computational Science and its Applications-ICCSA 2006, edited by M. Gavrilova, O. Gervasi, V. Kumar, C. J. Kenneth Tan, D. Taniar, A. Laganá, Y. Mun, and H. Choo, 728–737. Berlin: Springer.
   Google Scholar
• Kirkpatrick, S., C. D. Gelatt, and M. P. Vecchi. 1983. “Optimization by Simulated Annealing.” Science 220 (4598): 671–680.
   PubMed Web of Science ®Google Scholar
• Kravchenko, S., and F. Werner. 1997. “Parallel Machine Scheduling Problems with a Single Server.” Mathematical and Computer Modelling 26 (12):1–11.
   Web of Science ®Google Scholar
• Kumar, K., and V. Selladurai. 2011. “Ant Colony Approach for Makespan Minimization on Unrelated Parallel Machines.” International Journal of Engineering Science 3 (4): 3113–3120.
   Google Scholar
• Kurz, M., and R. Askin. 2001. “Heuristic Scheduling of Parallel Machines with Sequence-dependent Set-up Times.” International Journal of Production Research 39: 3747–3769.
   Web of Science ®Google Scholar
• Lin, S.-W., Z.-J. Lee, K.-C. Ying, and C.-C. Lu. 2011. “Minimization of Maximum Lateness on Parallel Machines with Sequence-dependent Setup Times and Job Release Dates.” Computers & Operations Research 38 (5): 809–815.
   Web of Science ®Google Scholar
• Liu, L., P. Olszewski , and P. C. Goh. 2011. “Combined Simulated Annealing and Genetic Algorithm Approach to Bus Network Design.” In Transport Systems Telematics, edited by J., Mikulski, 335–346. Berlin: Springer.
   Google Scholar
• Mendes, A., and F. Muller. 1999. “Comparing Metaheuristic Approaches for Parallel Machine Scheduling Problems with Sequencedependent Setup Times.” In Proceedings of the 15th International Conference on CAD/CAM Robotics & Factories of the Future, Aguas de Lindoia, Brasil, 1978.
   Google Scholar
• Min, L., and W. Cheng. 1999. “A Genetic Algorithm for Minimizing the Makespan in the Case of Scheduling Identical Parallel Machines.” Artificial Intelligence in Engineering 13 (4): 399–403.
   Google Scholar
• Ou, J., X. Qi, and C.-Y. Lee. 2009. “Parallel Machine Scheduling with Multiple Unloading Servers.” Journal of Scheduling 13 (3): 213–226.
   Web of Science ®Google Scholar
• Palesano, J., and J. Chandra. 1986. “A Machine Interference Problem with Multiple Types of Failures.” International Journal of Production Research 24 (3): 567–582.
   Web of Science ®Google Scholar
• Park, Y., S. Kim, and Y.-H. Lee. 2000. “Scheduling Jobs on Parallel Machines Applying Neural Network and Heuristic Rules.” Computers & Industrial Engineering 38 (1): 189–202.
   Web of Science ®Google Scholar
• Pfund, M., J. Fowler, and J. Gupta. 2004. “A Survey of Algorithms for Single and Multi-objective Unrelated Parallel-machine Deterministic Scheduling Problems.” Journal of the Chinese Institute of Industrial Engineers 21 (3): 230–241.
   Google Scholar
• Pósafalvi, A., and J. Sztrik. 1989. “A Numerical Approach to the Repairman Problem with Two Different Types of Machine.” Journal of the Operational Research Society 40 (9): 797–803.
   Web of Science ®Google Scholar
• Rabadi, G., R. Moraga, and A. Al-Salem. 2006. “Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times.” Journal of Intelligent Manufacturing 17: 85–97.
   Web of Science ®Google Scholar
• Radhakrishnan, S., and J. Ventura. 2000. “Simulated Annealing for Parallel Machine Scheduling with Earliness-Tardiness Penalties and Sequence-dependent Set-up Times.” International Journal of Production Research 38: 2233–2252.
   Web of Science ®Google Scholar
• Rocha, P. L., M. G. Ravetti, G. R. Mateus, and P. M. Pardalos. 2008. “Exact Algorithms for a Scheduling Problem with Unrelated Parallel Machines and Sequence and Machine-dependent Setup Times.” Computers & Operations Research 35 (4): 1250–1264.
   Web of Science ®Google Scholar
• Ruiz, R., and C. Andrés. 2007. “Unrelated Parallel Machines Scheduling with Resource-assignable Sequence Dependent Setup Times.” In Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA), Paris, France, 439–446.
   Google Scholar
• Sels, V., and M. Vanhoucke. 2011. “A Hybrid Dual-population Genetic Algorithm for the Single Machine Maximum Lateness Problem.” Lecture Notes in Computer Science 6622: 14–25.
   Google Scholar
• Sels, V., and M. Vanhoucke. 2012. “A Hybrid Genetic Algorithm for the Single Machine Maximum Lateness Problem with Release Times and Family Setups.” Computers & Operations Research, 39 (10): 2346–2358.
   Web of Science ®Google Scholar
• Sivrikaya-Serifoglu, F., and G. Ulusoy. 1999. “Parallel Machine Scheduling with Earliness and Tardiness Penalties.” Computers & Operations Research 26 (8): 773–787.
   Web of Science ®Google Scholar
• Stecke, K. E., and J. E. Aronson. 1985. “Review of Operator / Machine Interference Models.” International Journal of Production Research 23 (1): 129–151.
   Web of Science ®Google Scholar
• Talbi, E.-G. 2009. Metaheuristics: From Design to Implementation. Vol. 74. Hoboken, NJ: John & Wiley Sons. http://eu.wiley.com/WileyCDA/WileyTitle/productCd-0470278587.html
   Google Scholar
• Tavakkoli-Moghaddam, R., F. Taheri, M. Bazzazi, M. Izadi, and F. Sassani. 2009. “Design of a Genetic Algorithm for Bi-objective Unrelated Parallel Machines Scheduling with Sequence-dependent Setup Times and Precedence Constraints.” Computers & Operations Research 36 (12): 3224–3230.
   Web of Science ®Google Scholar
• Tosirisuk, P., and J. Chandra. 1995. “An Iterative Algorithm for a Multiple Finite-source Queueing Model with Dynamic Priority Scheduling.” Journal of the Operational Research Society 46 (7): 905–912.
   Web of Science ®Google Scholar
• Vallada, E., and R. Ruiz. 2011. “A Genetic Algorithm for the Unrelated Parallel Machine Scheduling Problem with Sequence Dependent Setup Times.” European Journal of Operational Research 211: 612–622.
   Web of Science ®Google Scholar
• Wang, B., X.-F. Yang, and Q.-Y. Li. 2009. “Genetic Simulated-annealing Algorithm for Robust Job Shop Scheduling.” Fuzzy Information and Engineering 2 (2): 817–827.
   Google Scholar
• Wang, G., and T. C. E. Cheng. 2001. “An Approximation Algorithm for Parallel Machine Scheduling with a Common Server.” Journal of the Operational Research Society 52 (2): 234–237.
   Web of Science ®Google Scholar
• Werner, F., and S. A. Kravchenko. 2010. “Scheduling with Multiple Servers.” Automation and Remote Control 71 (10): 2109–2121.
   Web of Science ®Google Scholar
• Yalaoui, F., and C. Chu. 2002. “Parallel Machine Scheduling to Minimize Total Tardiness.” International Journal of Production Economics 76 (3): 265–279.
   Web of Science ®Google Scholar
• Ying, K.-C., and H.-M. Cheng. 2010. “Dynamic Parallel Machine Scheduling with Sequence-dependent Setup Times Using an Iterated Greedy Heuristic.” Expert Systems with Applications 37 (4): 2848–2852.
   Web of Science ®Google Scholar
• Zhu, X., and W. W. E. Wilhelm. 2006. “Scheduling and Lot Sizing with Sequence-dependent Setup: A Literature Review.” IIE Transactions 38 (11): 987–1007.
   Web of Science ®Google Scholar
• Zhu, Z., and R. Heady. 2000. “Minimizing the Sum of Earliness/Tardiness in Multi-machine Scheduling: A Mixed Integer Programming Approach.” Computers & Industrial Engineering 38: 297–305.
   Web of Science ®Google Scholar