On the application of insertion techniques for job shop problems with setup times
RAIRO-Oper. Res., 33 2 (1999) 209-245
Published online: 2002-08-15
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Review of job shop scheduling research and its new perspectives under Industry 4.0
Jian Zhang, Guofu Ding, Yisheng Zou, Shengfeng Qin and Jianlin FuJournal of Intelligent Manufacturing 30 (4) 1809 (2019)
https://doi.org/10.1007/s10845-017-1350-2
Reducing efficiently the search tree for multiprocessor job-shop scheduling problems
Lester Carballo, Nodari Vakhania and Frank WernerInternational Journal of Production Research 51 (23-24) 7105 (2013)
https://doi.org/10.1080/00207543.2013.837226
Search on the enumeration tree in the multiprocessor job-shop problem
Lester Carballo, Alexander A. Lazarev, Nodari Vakhania and Frank WernerIFAC Proceedings Volumes 45 (6) 81 (2012)
https://doi.org/10.3182/20120523-3-RO-2023.00414
Deadlock prevention and performance oriented supervision in flexible manufacturing cells: A hierarchical approach
Sherif Fahmy, Subramaniam Balakrishnan and Tarek ElMekkawyRobotics and Computer-Integrated Manufacturing 27 (3) 591 (2011)
https://doi.org/10.1016/j.rcim.2010.10.006
A generic deadlock-free reactive scheduling approach
Sherif A. Fahmy, Subramaniam Balakrishnan and Tarek Y. ElMekkawyInternational Journal of Production Research 47 (20) 5657 (2009)
https://doi.org/10.1080/00207540802112652
Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
Márton Drótos, Gábor Erdős and Tamás KisEuropean Journal of Operational Research 197 (1) 296 (2009)
https://doi.org/10.1016/j.ejor.2008.06.004
A survey of scheduling problems with setup times or costs
Ali Allahverdi, C.T. Ng, T.C.E. Cheng and Mikhail Y. KovalyovEuropean Journal of Operational Research 187 (3) 985 (2008)
https://doi.org/10.1016/j.ejor.2006.06.060
Feasible job insertions in the multi-processor-task job shop
Heinz Gröflin, Andreas Klinkert and Nguyen Pham DinhEuropean Journal of Operational Research 185 (3) 1308 (2008)
https://doi.org/10.1016/j.ejor.2005.10.077
1794 (2008)
https://doi.org/10.1109/SOLI.2008.4682821
Feasible insertions in job shop scheduling, short cycles and stable sets
Heinz Gröflin and Andreas KlinkertEuropean Journal of Operational Research 177 (2) 763 (2007)
https://doi.org/10.1016/j.ejor.2005.12.025
2776 (2007)
https://doi.org/10.1109/ICSMC.2007.4413614
Analysis of reactive deadlock-free scheduling in flexible job shops
Sherif A. Fahmy, Tarek Y. ElMekkawy and Subramaniam BalakrishnanInternational Journal of Flexible Manufacturing Systems 19 (3) 264 (2007)
https://doi.org/10.1007/s10696-007-9026-4
Perspectives on Operations Research
Heidemarie BräselPerspectives on Operations Research 17 (2006)
https://doi.org/10.1007/978-3-8350-9064-4_2
SEQUENCE-DEPENDENT SETUP AND CLEAN-UP TIMES IN A TWO-MACHINE JOB-SHOP WITH MINIMIZING MAKESPAN
Yuri N. Sotskov and Frank WernerIFAC Proceedings Volumes 39 (3) 51 (2006)
https://doi.org/10.3182/20060517-3-FR-2903.00034
Schedule Generation Schemes for the Job-Shop Problem with Sequence-Dependent Setup Times: Dominance Properties and Computational Analysis
Christian Artigues, Pierre Lopez and Pierre-Dimitri AyacheAnnals of Operations Research 138 (1) 21 (2005)
https://doi.org/10.1007/s10479-005-2443-4
Two-Machine Flow Shop Scheduling with Nonregular Criteria
Jatinder N. D. Gupta, Volker Lauff and Frank WernerJournal of Mathematical Modelling and Algorithms 3 (2) 123 (2004)
https://doi.org/10.1023/B:JMMA.0000036573.01968.1b
A lower bound for the job insertion problem
Tamás Kis and Alain HertzDiscrete Applied Mathematics 128 (2-3) 395 (2003)
https://doi.org/10.1016/S0166-218X(02)00502-4
Heuristics for hybrid flow shops with controllable processing times and assignable due dates
Jatinder N.D. Gupta, Karin Krüger, Volker Lauff, Frank Werner and Yuri N. SotskovComputers & Operations Research 29 (10) 1417 (2002)
https://doi.org/10.1016/S0305-0548(01)00040-5
An efficient algorithm for operation insertion in a multi-resource job-shop schedule with sequence-dependent setup times
Christian Artigues and Ois RoubellatProduction Planning & Control 13 (2) 175 (2002)
https://doi.org/10.1080/09537280110069757
A Petri net model and a general method for on and off-line multi-resource shop floor scheduling with setup times
Christian Artigues and François RoubellatInternational Journal of Production Economics 74 (1-3) 63 (2001)
https://doi.org/10.1016/S0925-5273(01)00107-4
Minimizing total flow time in a two-machine flowshop problem with minimum makespan
Jatinder N.D Gupta, Venkata R Neppalli and Frank WernerInternational Journal of Production Economics 69 (3) 323 (2001)
https://doi.org/10.1016/S0925-5273(00)00039-6
A review of scheduling research involving setup considerations
Ali Allahverdi, Jatinder N.D Gupta and Tariq AldowaisanOmega 27 (2) 219 (1999)
https://doi.org/10.1016/S0305-0483(98)00042-5
A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size
D. Danneberg, T. Tautenhahn and F. WernerMathematical and Computer Modelling 29 (9) 101 (1999)
https://doi.org/10.1016/S0895-7177(99)00085-0