Parallel-machine scheduling with time dependent processing times

DOI10.1016/j.tcs.2007.12.004zbMath1136.68015OpenAlexW1974697581MaRDI QIDQ2481965

Dar-Li Yang, Wen-Hung Kuo

Publication date: 15 April 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.004

zbMATH Keywords

schedulingmakespanparallel machinetotal completion timetotal load

Mathematics Subject Classification ID

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

Related Items (12)

Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects ⋮ Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration ⋮ Two parallel-machine scheduling problems with function constraint ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ Uniform parallel-machine scheduling with time dependent processing times ⋮ Unrelated parallel-machine scheduling problems with multiple rate-modifying activities ⋮ Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects ⋮ Unrelated parallel-machine scheduling with aging effects and multi-maintenance activities ⋮ Parallel-machine scheduling with deteriorating jobs and rejection ⋮ Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times ⋮ Solving multi-objective parallel machine scheduling problem by a modified NSGA-II ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• Complexity of scheduling tasks with time-dependent execution times
• A concise survey of scheduling with time-dependent processing times
• Parallel machine scheduling with time dependent processing times
• Scheduling with time dependent processing times: Review and extensions
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Due-date assignment and single machine scheduling with deteriorating jobs
• Multi-Machine Scheduling With Linear Deterioration

This page was built for publication: Parallel-machine scheduling with time dependent processing times