Dirk Abels, Julian Jordi, Max Ostrowski, Torsten Schaub, Ambra Toletti & Philipp Wanko (2019):
Train scheduling with hybrid ASP.
In: International Conference on Logic Programming and Nonmonotonic Reasoning.
Springer,
pp. 3–17,
doi:10.1007/978-3-030-20528-7_1.
Michael Abseher, Martin Gebser, Nysret Musliu, Torsten Schaub & Stefan Woltran (2016):
Shift design with answer set programming.
Fundamenta Informaticae 147(1),
pp. 1–25,
doi:10.3233/FI-2016-1396.
Eni-Seok Byeon, S David Wu & Robert H Storer (1998):
Decomposition heuristics for robust job-shop scheduling.
IEEE Transactions on Robotics and Automation 14(2),
pp. 303–313,
doi:10.1109/70.681248.
Ebru Demirkol, Sanjay Mehta & Reha Uzsoy (1998):
Benchmarks for shop scheduling problems.
European Journal of Operational Research 109(1),
pp. 137–141,
doi:10.1016/S0377-2217(97)00019-2.
Mohammed El-Kholany, Konstantin Schekotihin & Martin Gebser (2022):
Decomposition-Based Job-Shop Scheduling with Constrained Clustering.
In: International Symposium on Practical Aspects of Declarative Languages.
Springer,
pp. 165–180,
doi:10.1007/978-3-030-94479-7_11.
Martin Gebser, Roland Kaminski, Benjamin Kaufmann & Torsten Schaub (2019):
Multi-shot ASP solving with clingo.
Theory and Practice of Logic Programming 19(1),
pp. 27–82,
doi:10.1017/S1471068418000054.
Oliver Holthaus & Chandrasekharan Rajendran (1997):
Efficient dispatching rules for scheduling in a job shop.
International Journal of Production Economics 48(1),
pp. 87–105,
doi:10.1016/S0925-5273(96)00068-0.
AK Kaban, Z Othman & DS Rohmah (2012):
Comparison of dispatching rules in job-shop scheduling problem using simulation: a case study.
International Journal of Simulation Modelling 11(3),
pp. 129–140,
doi:10.2507/IJSIMM11(3)2.201.
DA Koonce & S-C Tsai (2000):
Using data mining to find patterns in genetic algorithm solutions to a job shop schedule.
Computers & Industrial Engineering 38(3),
pp. 361–374,
doi:10.1016/S0360-8352(00)00050-4.
Denny Kopp, Michael Hassoun, Adar Kalir & Lars Mönch (2020):
SMT2020—A semiconductor manufacturing testbed.
IEEE Transactions on Semiconductor Manufacturing 33(4),
pp. 522–531,
doi:10.1109/TSM.2020.3001933.
Wen-Yang Ku & J Christopher Beck (2016):
Mixed integer programming models for job shop scheduling: A computational analysis.
Computers & Operations Research 73,
pp. 165–173,
doi:10.1016/j.cor.2016.04.006.
Jan Karel Lenstra, AHG Rinnooy Kan & Peter Brucker (1977):
Complexity of machine scheduling problems.
In: Annals of discrete mathematics 1.
Elsevier,
pp. 343–362,
doi:10.1016/S0167-5060(08)70743-X.
Vladimir Lifschitz (2002):
Answer set programming and plan generation.
Artificial Intelligence 138(1-2),
pp. 39–54,
doi:10.1016/S0004-3702(02)00186-8.
Leilei Meng, Chaoyong Zhang, Yaping Ren, Biao Zhang & Chang Lv (2020):
Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem.
Computers & Industrial Engineering 142,
pp. 106347,
doi:10.1016/j.cie.2020.106347.
Midhun Paul, R Sridharan & T Radha Ramanan (2015):
An investigation of order review/release policies and dispatching rules for assembly job shops with multi objective criteria.
Procedia-Social and Behavioral Sciences 189,
pp. 376–384,
doi:10.1016/j.sbspro.2015.03.234.
Francesco Ricca, Giovanni Grasso, Mario Alviano, Marco Manna, Vincenzino Lio, Salvatore Iiritano & Nicola Leone (2012):
Team-building with answer set programming in the Gioia-Tauro seaport.
Theory and Practice of Logic Programming 12(3),
pp. 361–381,
doi:10.1017/S147106841100007X.
Atif Shahzad, Nasser Mebarki & IRCCyN IRCCyN (2010):
Discovering dispatching rules for job shop scheduling problem through data mining.
In: 8th International Conference of Modeling and Simulation-MOSIM,
pp. 10–12.
Marcos Singer (2001):
Decomposition methods for large job shops.
Computers & Operations Research 28(3),
pp. 193–207,
doi:10.1016/S0305-0548(99)00098-2.
Eric Taillard (1993):
Benchmarks for basic scheduling problems.
european journal of operational research 64(2),
pp. 278–285,
doi:10.1016/0377-2217(93)90182-M.
Yingni Zhai, Changjun Liu, Wei Chu, Ruifeng Guo & Cunliang Liu (2014):
A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems.
Journal of Industrial Engineering and Management (JIEM) 7(5),
pp. 1397–1414,
doi:10.3926/jiem.1206.
Rui Zhang & Cheng Wu (2010):
A hybrid approach to large-scale job shop scheduling.
Applied intelligence 32(1),
pp. 47–59,
doi:10.1007/s10489-008-0134-y.
eptcs@eptcs.org