Narrow search
Showing 1 - 10 of 2,087
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
Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
Wang, Jian-Jun; Zhang, Bing-Hang - In: Computers & operations research : and their … 58 (2015), pp. 24-31
Persistent link: https://www.econbiz.de/10010509425
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
Efficient non-population-based algorithms for the permutation flowshop scheduling problem with makespan minimisation subject to a maximum tardiness
Fernandez-Viagas, Victor; Framinan, Jose M. - In: Computers & operations research : and their … 64 (2015), pp. 86-96
Persistent link: https://www.econbiz.de/10011373449
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
Cover Image
Minimizing the total completion time in a two-machine flowshop with sequence-independent setup times
Ladhari, T.; Msakni, M. K.; Allahverdi, A. - In: Journal of the Operational Research Society : OR 63 (2012) 4, pp. 445-459
Persistent link: https://www.econbiz.de/10009522319
Cover Image
MIP models and hybrid algorithm for minimizing the makespan of parallel machines scheduling problem with a single server
Kim, Mi-yi; Yi, Yŏng-hun - In: Computers & operations research : and their … 39 (2012) 11, pp. 2457-2468
Persistent link: https://www.econbiz.de/10009552501
Cover Image
Accelerated methods for total tardiness minimisation in no-wait flowshops
Ding, Jianya; Song, Shiji; Zhang, Rui; Gupta, Nabanita Datta - In: International journal of production research 53 (2015) 4, pp. 1002-1018
Persistent link: https://www.econbiz.de/10010493066
Cover Image
Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility
Thevenin, Simon; Zufferey, Nicolas; Potvin, Jean-Yves - In: International journal of production research 55 (2017) 5/6, pp. 1588-1606
Persistent link: https://www.econbiz.de/10011628297