Parallel machines scheduling with machine shutdowns

DOI10.1016/S0898-1221(98)00126-6zbMath0939.68003MaRDI QIDQ1806577

Yanyan Li

Publication date: 8 November 1999

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

nonpreemptive parallel machines scheduling problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (13)

Parallel machine scheduling with machine availability and eligibility constraints ⋮ A SEMI-ON-LINE SCHEDULING PROBLEM OF TWO PARALLEL MACHINES WITH COMMON MAINTENANCE TIME ⋮ Scheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraints ⋮ An on-line scheduling problem of parallel machines with common maintenance time ⋮ Scheduling on same-speed processors with at most one downtime on each machine ⋮ Parallel machine scheduling with almost periodic maintenance and non-preemptive jobs to minimize makespan ⋮ Scheduling on uniform processors with at most one downtime on each machine ⋮ A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times ⋮ The effect of machine availability on the worst-case performance of LPT ⋮ Scheduling jobs with service level requirements on parallel machines under availability and eligibility constraints ⋮ An optimal semi-online algorithm for 2-machine scheduling with an availability constraint ⋮ Optimal online algorithm for scheduling on two identical machines with machine availability constraints. ⋮ Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

Cites Work

• Unnamed Item
• Parallel machines scheduling with nonsimultaneous machine available time
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Parallel machines scheduling with machine shutdowns