Scheduling unit-length jobs with machine eligibility restrictions

DOI10.1016/j.ejor.2005.03.023zbMath1102.90023OpenAlexW2033983497MaRDI QIDQ2503099

Chung-Lun Li

Publication date: 13 September 2006

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

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

zbMATH Keywords

schedulinguniform machinesmachine eligibility restrictionsunit-length jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Single machine scheduling with two competing agents, arbitrary release dates and unit processing times, Optimal restricted due date assignment in scheduling, Parallel machine scheduling with nested processing set restrictions, Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines, Smoothed performance guarantees for local search, Scheduling uniform machines with restricted assignment, Scheduling jobs with equal processing times subject to machine eligibility constraints, Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines, Performance guarantees of jump neighborhoods on restricted related parallel machines, The ``least flexible job first rule in scheduling and in queueing, Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan, Multipurpose machine scheduling with rejection and identical job processing times, Faster Algorithms for Semi-Matching Problems, Scheduling equal length jobs with eligibility restrictions

Cites Work

• New scaling algorithms for the assignment and minimum mean cycle problems
• Parallel machine scheduling of machine-dependent jobs with unit-length.
• Unnamed Item
• Unnamed Item