Narrow search
Showing 1 - 10 of 5,787
Cover Image
The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
Shabtay, Dvir - In: European journal of operational research : EJOR 233 (2014) 1, pp. 64-74
Persistent link: https://www.econbiz.de/10010224939
Cover Image
A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
Baraz, Daniel; Mosheiov, Gur - In: European journal of operational research : EJOR 184 (2008) 2, pp. 810-813
Persistent link: https://www.econbiz.de/10003768344
Cover Image
Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion
Wang, Chuyang; Li, Xiaoping; Wang, Qian - In: European journal of operational research : EJOR 206 (2010) 1, pp. 64-72
Persistent link: https://www.econbiz.de/10003968286
Cover Image
Scheduling three chains on two parallel machines
Agnetis, Alessandro; Flamini, Marta; Nicosia, Gaia; … - In: European journal of operational research : EJOR 202 (2010) 3, pp. 669-674
Persistent link: https://www.econbiz.de/10003978867
Cover Image
Scheduling multiple orders per job in a single machine to minimize total completion time
Mason, Scott J.; Chen, Jen-shiang - In: European journal of operational research : EJOR 207 (2010) 1, pp. 70-77
Persistent link: https://www.econbiz.de/10003996745
Cover Image
A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem
Ocetkiewicz, Krzysztof M. - In: European journal of operational research : EJOR 203 (2010) 2, pp. 316-320
Persistent link: https://www.econbiz.de/10003943709
Cover Image
The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
Munier-Kordon, Alix; Rebaine, Djamal - In: European journal of operational research : EJOR 203 (2010) 1, pp. 42-49
Persistent link: https://www.econbiz.de/10003928077
Cover Image
Preemptive scheduling of two uniform parallel machines to minimize total tardiness
Lushchakova, Irina N. - In: European journal of operational research : EJOR 219 (2012) 1, pp. 27-33
Persistent link: https://www.econbiz.de/10009511718
Cover Image
An O(n2) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
Panwalkar, S. S.; Koulamas, Christos - In: European journal of operational research : EJOR 221 (2012) 1, pp. 7-13
Persistent link: https://www.econbiz.de/10009553176
Cover Image
A real-time order acceptance and scheduling approach for permutation flow shop problems
Rahman, Humyun Fuad; Sarker, Ruhul; Essam, Daryl - In: European journal of operational research : EJOR 247 (2015) 2, pp. 488-503
Persistent link: https://www.econbiz.de/10011374482