Abstract
This work considers the production scheduling of the weaving process in a real-life textile industry, where a set of jobs - linked to the production of a fabric type and accompanied by a quantity - arrive over time and have to be processed (woven) by a set of parallel unrelated machines (looms) with respect to their strict deadlines (delivery dates), under the goal of makespan minimization. A number of critical job and machine properties demonstrate the challenging nature of weaving scheduling, i.e., a) job splitting: each order’s quantity is allowed to be split and processed on multiple machines simultaneously, b) sequence-dependent setup times: the setup time between any two orders j and k is different than setup time between jobs k and j on the same machine and c) setup resource constraints: the number of setups that can be performed simultaneously on different machines is restricted due to a limited number of setup workers. We propose a MILP formulation that captures the entire weaving process. To handle large real instances, while also speeding up an exact solver on smaller ones, we propose two heuristics that perform job-splitting and assignment of jobs to machines either greedily or by using a relaxed version of our MILP model, respectively. We evaluate the impact of our approach on real datasets under user-imposed time limits and resources (machines, workers) availability.
This research has been supported by the EU through the FACTLOG Horizon 2020 project, grant number 869951.
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
References
Allahverdi, A., Ng, C.-T., Cheng, T.E., Kovalyov, Y.: A survey of scheduling problems with setup times or costs. EJOR 187, 985–1032 (2008)
Aspnes, Y., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. JACM 44(3), 486–504 (1997)
Brucker, P.: Scheduling Algorithms. Springer, Heidelberg (1999)
Correa, J., Verdugo, V., Verschae, J.: Splitting versus setup trade-offs for scheduling to minimize weighted completion time. ORL 44, 469–473 (2016)
Eroglu, D.Y., Ozmutlu, H.C.: Solution method for a large-scale loom scheduling problem with machine eligibility and splitting property. TJTI 108(12), 2154–2165 (2017)
Eroglu, D.Y., Ozmutlu, H.C., Ozmutlu, S.: Genetic algorithm with local search for the unrelated parallel machine scheduling problem with sequence-dependent set-up times. IJPR 52(19), 5841–5856 (2014)
Letsios, D., Bradley, J.T., Suraj, G., Misener, R., Page, N.: Approximate and robust bounded job start scheduling for Royal Mail delivery offices. JOS 24, 1–22 (2021)
Lee, J.-H., Hoon Jang, H., Kim, H.-J.: Iterative job splitting algorithms for parallel machine scheduling with job splitting and setup resource constraints. JORS 72, 780–799 (2020)
Peyro, L.F.: Models and an exact method for the unrelated parallel machine scheduling problem with setups and resources. ESWA 5, 100022 (2020)
Peyro, L.F., Ruiz, R., Perea, F.: Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times. COR 81, 173–182 (2019)
Pimentel, C., Alvelos, F., Duarte, A., Carvalho, J.: Exact and heuristic approaches for lot splitting and scheduling on identical parallel machine. IJMTM 22(1), 39–57 (2011)
Roberti, R., Toth, P.: Models and algorithms for the asymmetric traveling salesman problem: an experimental comparison. EJTL 1, 113–133 (2012)
Avalos-Rosales, O., Angel-Bello, F., Alvarez, A.: Efficient metaheuristic algorithm and re-formulations for the unrelated parallel machine scheduling problem with sequence and machine-dependent setup times. Int. J. Adv. Manuf. Technol. 1705–1718 (2014)
Serafini, P.: Scheduling jobs on several machines with job splitting property. INFORMS J. Comp. 44, 531–659 (1996)
Wang, J.-B., Wang, J.-J.: Research on scheduling with job-dependent learning effect and convex resource-dependent processing times. IJPR 53(19), 5826–5836 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 IFIP International Federation for Information Processing
About this paper
Cite this paper
Mourtos, I., Vatikiotis, S., Zois, G. (2021). Scheduling Jobs on Unrelated Machines with Job Splitting and Setup Resource Constraints for Weaving in Textile Manufacturing. In: Dolgui, A., Bernard, A., Lemoine, D., von Cieminski, G., Romero, D. (eds) Advances in Production Management Systems. Artificial Intelligence for Sustainable and Resilient Production Systems. APMS 2021. IFIP Advances in Information and Communication Technology, vol 630. Springer, Cham. https://doi.org/10.1007/978-3-030-85874-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-030-85874-2_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-85873-5
Online ISBN: 978-3-030-85874-2
eBook Packages: Computer ScienceComputer Science (R0)
