Narrow search
Showing 1 - 10 of 1,126
Cover Image
The two-machine flowshop total completion time problem : branch-and-bound algorithms based on network-flow formulation
Detienne, Boris; Sadykov, Ruslan; Tanaka, Shunji - In: European journal of operational research : EJOR 252 (2016) 3, pp. 750-760
Persistent link: https://www.econbiz.de/10011472309
Cover Image
A job shop distributed scheduling based on Lagrangian relaxation to minimise total completion time
Jeong, In-jae; Yim, Seung-bin - In: International journal of production research 47 (2009) 24, pp. 6783-6805
Persistent link: https://www.econbiz.de/10003914116
Cover Image
A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
Sels, Veronique; Vanhoucke, Mario - In: Computers & operations research : and their … 39 (2012) 10, pp. 2346-2358
Persistent link: https://www.econbiz.de/10009510268
Cover Image
A modified ant-colony optimisation algorithm to minimise the completion time variance of jobs in flowshops
Krishnaraj, J.; Pugazhendhi, S.; Rajendran, Chandrasekharan - In: International journal of production research 50 (2012) 20, pp. 5698-5706
Persistent link: https://www.econbiz.de/10009670411
Cover Image
Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
Jeong, BongJoo; Kim, Yeong-dae - In: Computers & operations research : and their … 47 (2014), pp. 72-80
Persistent link: https://www.econbiz.de/10010364548
Cover Image
Competitive bi-agent flowshop scheduling to minimise the weighted combination of makespans
Bai, Danyu; Diabat, Ali; Wang, Xinyue; Yang, Dandan; Fu, Yao - In: International journal of production research 60 (2022) 22, pp. 6750-6771
Persistent link: https://www.econbiz.de/10013501121
Cover Image
A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan
Ozturk, Onur; Begen, Mehmet A.; Zaric, Gregory S. - In: International journal of production research 55 (2017) 5/6, pp. 1815-1831
Persistent link: https://www.econbiz.de/10011628422
Cover Image
Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty
Silva, Marco; Poss, Michael; Maculan F., Nelson - In: European journal of operational research : EJOR 283 (2020) 1, pp. 70-82
Persistent link: https://www.econbiz.de/10012161923
Cover Image
Comparison of some heuristic algorithms for the flow shop problem with parallel machines to minimize the total earliness, tardiness and waiting time
Janiak, Adam; Lichtenstein, Maciej - In: Operations research proceedings 2000 : selected papers …, (pp. 378-383). 2001
Persistent link: https://www.econbiz.de/10001571664
Cover Image
Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
Leite Rocha, Pedro; Ravetti, Martín Gómez; Mateus, … - In: Computers & operations research : and their … 35 (2008) 4, pp. 1250-1264
Persistent link: https://www.econbiz.de/10003670200