Scheduling parallel manufacturing cells with resource flexibility
Management Science
Computers and Operations Research
Machine scheduling with resource dependent processing times
Mathematical Programming: Series A and B
Scheduling parallel jobs with linear speedup
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Unrelated parallel machine scheduling with resource dependent processing times
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
LP rounding and an almost harmonic algorithm for scheduling with resource dependent processing times
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Operations Research Letters
Scheduling jobs with time-resource tradeoff via nonlinear programming
Discrete Optimization
| Hi-index | 0.00 |
Parallel machine flexible resource scheduling (PMFRS) problems consider an additional flexible resource (e.g. operators), which can be freely allocated to any jobs and/or any machines and may speed-up the process in proportion to its amount. If job-machine assignment is unspecified, the problem is referred to as unspecified PMFRS (UPMFRS). This paper reviews the mathematical models of both PMFRS and UPMFRS problems in the literature and not only gives some extensions to the model of dynamic PMFRS problem but also presents integer programming (IP) models for static and dynamic UPMFRS problems with the objective of minimizing makespan. To solve large-sized dynamic PMFRS and UPMFRS problems, a relaxed IP based constraint programming (CP) approach is also proposed. All IP models and the proposed IP/CP approach are tested with an extensive computational study. The results of the computational experiments are discussed with respect to the major parameters of the problem and conclusions are drawn.