Identical parallel machine scheduling with time-dependent processing times

DOI10.1016/j.tcs.2017.12.001zbMath1390.90323OpenAlexW2774971798WikidataQ57514799 ScholiaQ57514799MaRDI QIDQ1704597

Farouk Yalaoui, Yassine Ouazene

Publication date: 12 March 2018

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

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

zbMATH Keywords

makespanparallel machine schedulingheuristic methodslexicographic searchsimple deteriorating jobstwo-machine-optimal algorithm

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• Approximation algorithms for parallel machine scheduling with linear deterioration
• Parallel-machine scheduling with deteriorating jobs and rejection
• Parallel-machine scheduling of simple linear deteriorating jobs
• Time-dependent scheduling
• A concise survey of scheduling with time-dependent processing times
• Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times
• Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
• Parallel machine scheduling with time dependent processing times
• An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
• Scheduling with time dependent processing times: Review and extensions
• An Application of Bin-Packing to Multiprocessor Scheduling
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• Multi-Machine Scheduling With Linear Deterioration

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