Parallel machine scheduling of machine-dependent jobs with unit-length.

DOI10.1016/S0377-2217(02)00914-1zbMath1045.90029MaRDI QIDQ1426708

Yanpei Liu, Wenhua Li

Publication date: 15 March 2004

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

zbMATH Keywords

Schedulingeligibility constraintMachineParallel machineUnit-length job

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (21)

Minimising makespan on parallel machines with precedence constraints and machine eligibility restrictions ⋮ Parallel machine scheduling with machine availability and eligibility constraints ⋮ Parallel machine scheduling with nested processing set restrictions ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ Makespan minimization on unrelated parallel machines with a few bags ⋮ Approximation algorithms for the graph balancing problem with two speeds and two job lengths ⋮ Scheduling uniform machines with restricted assignment ⋮ Literal Selection in Switching Lattice Design ⋮ 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 ⋮ Online scheduling on a single machine with grouped processing times ⋮ Scheduling unit length jobs on parallel machines with lookahead information ⋮ On the configuration-LP for scheduling on unrelated machines ⋮ Online scheduling of two job types on a set of multipurpose machines with unit processing times ⋮ Multipurpose machine scheduling with rejection and identical job processing times ⋮ Improved bounds for online scheduling with eligibility constraints ⋮ Scheduling unit-length jobs with machine eligibility restrictions ⋮ A note on graph balancing problems with restrictions ⋮ Faster Algorithms for Semi-Matching Problems ⋮ PARALLEL MACHINE SCHEDULING WITH A SIMULTANEITY CONSTRAINT AND UNIT-LENGTH JOBS TO MINIMIZE THE MAKESPAN ⋮ Makespan minimization on unrelated parallel machines with simple job-intersection structure and bounded job assignments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A state-of-the-art review of parallel-machine scheduling research
• The Loading Time Scheduling Problem

This page was built for publication: Parallel machine scheduling of machine-dependent jobs with unit-length.