论文信息 - The parallel machine job splitting and allocation

The parallel machine job splitting and allocation

In this paper, we propose novel optimal / near optimal approach to model and solve the time-dependent job splitting and allocation over parallel machines by exploiting the iterative structure of the model and the search. We compare global search deterministic method to genetic algorithm hueristic.

Samah A. M. Ghanem

[1] Jiawei Zhang,et al. Parallel machine scheduling with splitting jobs , 2000, Discret. Appl. Math..

[2] Eugene L. Lawler,et al. Chapter 9 Sequencing and scheduling: Algorithms and complexity , 1993, Logistics of Production and Inventory.

[3] Kokin Lam,et al. New trends in parallel machine scheduling , 1997 .

[4] Johannes M.J. Schutten,et al. Parallel machine scheduling with release dates, due dates and family setup times , 1996 .

[5] Inci Saricicek,et al. Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness , 2011 .

[6] Chris N. Potts,et al. Unrelated parallel machine scheduling using local search , 1994 .

[7] Jacques Carlier,et al. Scheduling jobs with release dates and tails on identical machines to minimize the makespan , 1987 .

[8] Dipak Chaudhuri,et al. Bicriteria scheduling problem for unrelated parallel machines , 1996 .

[9] N. Piersma,et al. A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search , 1996 .

[10] Fenny Subur. A methodology for real-time scheduling of jobs with splitting on unrelated parallel machines , 2000 .