Scheduling parallel machines with inclusive processing set restrictions and job release times

From MaRDI portal
Revision as of 23:55, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1044087


DOI10.1016/j.ejor.2009.02.011zbMath1177.90170MaRDI QIDQ1044087

Chung-Lun Li, Xiuli Wang

Publication date: 10 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10397/1834


90B35: Deterministic scheduling theory in operations research


Related Items

Fast approximation algorithms for job scheduling with processing set restrictions, Particle swarm optimization algorithm for unrelated parallel machine scheduling with release dates, Improved approximation algorithms for parallel machine scheduling with release dates and job rejection, Improved bounds for online scheduling with eligibility constraints, A fast preemptive scheduling algorithm with release times and inclusive processing set restrictions, Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities, Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, Fast approximation algorithms for uniform machine scheduling with processing set restrictions, Multipurpose machine scheduling with rejection and identical job processing times, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration, Scheduling jobs with release and delivery times subject to nested eligibility constraints, Parallel batch scheduling with nested processing set restrictions, The ``least flexible job first rule in scheduling and in queueing, Parallel machine scheduling with nested processing set restrictions, Scheduling uniform machines with restricted assignment, A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions



Cites Work