Abstract
Online scheduling of operations is essential to optimize productivity of flexible manufacturing systems (FMSs) where manufacturing requests arrive on the fly. An FMS processes products according to a particular flow through processing stations. This work focusses on online scheduling of re-entrant FMSs with flows using processing stations where products pass twice and with limited buffering between processing stations. This kind of FMS is modelled as a re-entrant flow shop with due dates and sequence-dependent set-up times. Such flow shops can benefit from minimization of the time penalties incurred from set-up times. On top of an existing greedy scheduling heuristic we apply a meta-heuristic that simultaneously explores several alternatives considering trade-offs between the used metrics by the scheduling heuristic. We identify invariants to efficiently remove many infeasible scheduling options so that the running time of online implementations is improved. The resulting algorithm is much faster than the state of the art and produces schedules with on average 4.6% shorter makespan.
- Gerd Behrmann, Ed Brinksma, Martijn Hendriks, and Angelika Mader. 2005. Production scheduling by reachability analysis: a case study. In Parallel and Distributed Processing Symposium, 2005. Proceedings. 19th IEEE International. IEEE, Los Alamitos, CA, USA, 140--142. Google Scholar
Digital Library
- Richard Bellman. 1958. On a routing problem. Quarterly of Applied Mathematics 16, 1 (1958), 87--90.Google Scholar
Cross Ref
- Jim Browne, Didier Dubois, Keith Rathmill, Suresh P. Sethi, and Kathryn E. Stecke. 1984. Classification of flexible manufacturing systems. The FMS Magazine 2, 2 (1984), 114--117.Google Scholar
- Frederico Busato and Nicola Bombieri. 2016. An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures. IEEE Transactions on Parallel and Distributed Systems 27, 8 (Aug 2016), 2222--2233.Google Scholar
Cross Ref
- Suresh Chand, Rodney Traub, and Reha Uzsoy. 1997. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Annals of Operations Research 70, 0 (1997), 115--125.Google Scholar
Cross Ref
- Jen-Shiang Chen, Jason Chao-Hsien Pan, and Chien-Kuang Wu. 2008. Hybrid tabu search for re-entrant permutation flow-shop scheduling problem. Expert Systems with Applications 34, 3 (2008), 1924--1930. Google Scholar
Digital Library
- Ebru Demirkol and Reha Uzsoy. 2000. Decomposition methods for reentrant flow shops with sequence-dependent setup times. Journal of Scheduling 3, 3 (2000), 155--177.Google Scholar
Cross Ref
- Lester R. Ford Jr. 1956. Network Flow Theory. Rand Corp, Santa Monica, CA, USA.Google Scholar
- Józef Grabowski, Ewa Skubalska, and Czesław Smutnicki. 1983. On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness. Journal of Operational Research Society 34, 7 (1983), 615--620.Google Scholar
Cross Ref
- Ronald L. Graham, Eugene L. Lawler, Jan Karel Lenstra, and AHG Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics 5 (1979), 287--326.Google Scholar
Cross Ref
- BongJoo Jeong and Yeong-Dae Kim. 2014. Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times. Computers and Operations Research 47 (2014), 72--80. Google Scholar
Digital Library
- Caixia Jing, Wanzhen Huang, and Guochun Tang. 2011. Minimizing total completion time for re-entrant flow shop scheduling problems. Theoretical Computer Science 412, 48 (2011), 6712--6719. Google Scholar
Digital Library
- Jitti Jungwattanakit, Manop Reodecha, Paveena Chaovalitwongse, and Frank Werner. 2008. Algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria. International Journal of Advanced Manufacturing Technology 37, 3 (2008), 354--370.Google Scholar
Cross Ref
- Wieslaw Kubiak, Sheldon XC Lou, and Yingmeng Wang. 1996. Mean flow time minimization in reentrant job shops with a hub. Operations Research 44, 5 (1996), 764--776. Google Scholar
Digital Library
- Jason Chao-Hsien Pan and Jen-Shiang Chen. 2003. Minimizing makespan in re-entrant permutation flow-shops. Journal of the Operational Research Society 54, 6 (2003), 642--653.Google Scholar
Cross Ref
- Robert Sedgewick and Kevin Wayne. 2011. Algorithms, 4th Edition. Addison-Wesley. Google Scholar
Digital Library
- John P. Shewchuk and Colin L. Moodie. 1998. Definition and Classification of Manufacturing Flexibility Types and Measures. International Journal of Flexible Manufacturing Systems 10, 4 (1998), 325--349.Google Scholar
Cross Ref
- Hamid Shojaei, Twan Basten, Marc Geilen, and Azadeh Davoodi. 2013. A Fast and Scalable Multidimensional Multiple-choice Knapsack Heuristic. ACM Trans. Des. Autom. Electron. Syst. 18, 4, Article 51 (Oct. 2013), 32 pages. Google Scholar
Digital Library
- Joost van Pinxten, Marc Geilen, Twan Basten, Umar Waqas, and Lou Somers. 2016. Online heuristic for the Multi-Objective Generalized traveling salesman problem. In Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE), 2016. 822--825. Google Scholar
Digital Library
- Umar Waqas, Marc Geilen, Jack Kandelaars, Lou Somers, Twan Basten, Sander Stuijk, Patrick Vestjens, and Henk Corporaal. 2015. A Re-entrant Flowshop Heuristic for Online Scheduling of the Paper Path in a Large Scale Printer. In Design, Automation 8 Test in Europe Conference 8 Exhibition (DATE), 2015. 573--578. Google Scholar
Digital Library
- Eckart Zitzler, Marco Laumanns, and Lothar Thiele. 2001. SPEA2: Improving the Strength Pareto Evolutionary Algorithm. Technical Report. Swiss Federal Institute of Technology (ETH) Zurich.Google Scholar
Index Terms
Online Scheduling of 2-Re-entrant Flexible Manufacturing Systems
Recommendations
Flexible Job-shop Scheduling Problem with Sequence-dependent Setup Times using Genetic Algorithm
ICEIS 2016: Proceedings of the 18th International Conference on Enterprise Information SystemsJob shop scheduling problems (JSSP) are among the most intensive combinatorial problems studied in literature. The flexible job shop problem (FJSP) is a generalization of the classical JSSP where each operation can be processed by more than one ...
Online Flexible Job Scheduling for Minimum Span
SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and ArchitecturesIn this paper, we study an online Flexible Job Scheduling (FJS) problem. The input of the problem is a set of jobs, each having an arrival time, a starting deadline and a processing length. Each job has to be started by the scheduler between its arrival ...
Genetic algorithms for match-up rescheduling of the flexible manufacturing systems
Scheduling plays a vital role in ensuring the effectiveness of the production control of a flexible manufacturing system (FMS). The scheduling problem in FMS is considered to be dynamic in its nature as new orders may arrive every day. The new orders ...






Comments