Narrow search
Showing 1 - 10 of 1,067
Cover Image
Minimising total weighted earliness and tardiness on parallel machines using a hybrid heuristic
M'Hallah, Rym; Al-Khamis, Talal - In: International journal of production research 50 (2012) 10, pp. 2639-2664
Persistent link: https://www.econbiz.de/10009575428
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
An efficient approach for the reentrant parallel machines scheduling problem under consumable resources constraints
Belkaid, Fayçal; Yalaoui, Farouk; Sari, Zaki - In: International journal of information systems and supply … 9 (2016) 3, pp. 1-25
Persistent link: https://www.econbiz.de/10011593140
Cover Image
Minimising total tardiness for the identical parallel machine scheduling problem with splitting jobs and sequence-dependent setup times
Kim, Jae-Gon; Song, Seokwoo; Jeong, BongJoo - In: International journal of production research 58 (2020) 6, pp. 1628-1643
Persistent link: https://www.econbiz.de/10012194118
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 two-stage three-machine assembly scheduling problem with deterioration effect
Wu, Chin-Chia; Azzouz, Ameni; Chung, I. Hong; Lin, Win-Chin - In: International journal of production research 57 (2019) 21, pp. 6634-6647
Persistent link: https://www.econbiz.de/10012193771
Cover Image
A branche and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals
Yao, Shiqing; Jiang, Zhibin; Li, Na - In: Computers & operations research : and their … 39 (2012) 5, pp. 939-951
Persistent link: https://www.econbiz.de/10010217415
Cover Image
A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem
Gmys, Jan; Mezmaz, Mohand; Melab, Nouredine; Tuyttens, … - In: European journal of operational research : EJOR 284 (2020) 3, pp. 814-833
Persistent link: https://www.econbiz.de/10012238910
Cover Image
A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
Toksari, M. Duran - In: RAIRO / Operations research 50 (2016) 1, pp. 211-219
Persistent link: https://www.econbiz.de/10011641518
Cover Image
An adaptive penalty guided genetic algorithm for scheduling parallel batch processing machines
Xu, Shubin - In: International journal of applied management science 10 (2018) 3, pp. 247-268
Persistent link: https://www.econbiz.de/10011969051