Search Results - subject:"Parallel machine"

Restricted job completion time variance minimisation on identical parallel machines

Chen, Yuerong; Li, Xueping; Sawhney, Rapinder - In: European Journal of Industrial Engineering 3 (2009) 3, pp. 261-276

This paper is concerned with scheduling a number of jobs on multiple identical parallel machines to minimise job Completion Time Variance (CTV), which is a performance measure that emphasises providing uniform service to jobs. CTV minimisation is closely related to common due date problems,...

Persistent link: https://www.econbiz.de/10008563631

Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers

Wang, Xiuli; Cheng, T. C. E. - In: International journal of production economics 119 (2009) 1, pp. 199-206

Persistent link: https://www.econbiz.de/10003884731

Rescheduling of unrelated parallel machines under machine breakdowns

Arnaout, Jean-Paul; Rabadi, Ghaith - In: International Journal of Applied Management Science 1 (2008) 1, pp. 75-89

In this paper, new repair and rescheduling algorithms are developed for the unrelated parallel machine environment. The …

Persistent link: https://www.econbiz.de/10008538822

Rescheduling of unrelated parallel machines under machine breakdowns

Arnaout, Jean-Paul; Rabadi, Ghaith - In: International Journal of Applied Management Science 1 (2008) 1, pp. 75-89

In this paper, new repair and rescheduling algorithms are developed for the unrelated parallel machine environment. The …

Persistent link: https://www.econbiz.de/10005236946

ONLINE ALGORITHMS FOR SCHEDULING WITH MACHINE ACTIVATION COST

HE, YONG; HAN, SHUGUANG; JIANG, YIWEI - In: Asia-Pacific Journal of Operational Research (APJOR) 24 (2007) 02, pp. 263-277

In this paper, we consider a variant of the classical parallel machine scheduling problem. For this problem, we are …

Persistent link: https://www.econbiz.de/10005047159

Parallel Machine Scheduling by Column Generation

DEN AKKER, Janna M. VAN; HOOGEVEEN, J.A.; DE VELDE, … - Center for Operations Research and Econometrics (CORE), … - 1996

Parallel machine scheduling problems concern the scheduling of n jobs on m machines to minimize some function of the …, we formulate these parallel machine scheduling problems as a set covering problems with an exponential number of binary …

Persistent link: https://www.econbiz.de/10005065288

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

Baptiste, Philippe; Timkovsky, Vadim G. - In: Mathematical Methods of Operations Research 60 (2004) 1, pp. 145-153

Ideal schedules reach both minimum maximum completion time and minimum total completion time of jobs. It is known that there exist computable in polynomial time ideal nonpreemptive two-machine schedules of unit-time operation jobs with equal release dates and arbitrary precedence constraints on...

Persistent link: https://www.econbiz.de/10010999907

Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time

Baptiste, Philippe; Timkovsky, Vadim G. - In: Computational Statistics 60 (2004) 1, pp. 145-153

Persistent link: https://www.econbiz.de/10010759495