Identical parallel machine scheduling with time-dependent processing times

DOI10.1016/J.TCS.2017.12.001zbMATH Open1390.90323OpenAlexW2774971798WikidataQ57514799 ScholiaQ57514799MaRDI QIDQ1704597FDOQ1704597

Authors Yassine Ouazene, Farouk Yalaoui

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)

Recommendations

• Parallel Processing and Applied Mathematics
• scientific article; zbMATH DE number 6378894
• An approximation algorithm for parallel machine scheduling with simple linear deterioration
• Parallel-machine scheduling with simple linear deterioration to minimize total completion time
• Algorithms and Computation

Cites work

• scientific article; zbMATH DE number 849179 (Why is no real title available?)
• A concise survey of scheduling with time-dependent processing times
• An Application of Bin-Packing to Multiprocessor Scheduling
• An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
• Approximation algorithms for parallel machine scheduling with linear deterioration
• Multi-Machine Scheduling With Linear Deterioration
• NP-hard cases in scheduling deteriorating jobs on dedicated machines
• Parallel machine scheduling with time dependent processing times
• Parallel-machine scheduling of simple linear deteriorating jobs
• Parallel-machine scheduling with deteriorating jobs and rejection
• Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
• Scheduling with time dependent processing times: Review and extensions
• Time-dependent scheduling
• Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times

Cited in

(11)

• Scheduling jobs within time windows on identical parallel machines: New model and algorithms
• Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
• Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Scheduling identical parallel machines with tooling constraints
• Parallel Processing and Applied Mathematics
• Scheduling jobs with equal processing times and a single server on parallel identical machines
• Interval scheduling on identical machines
• Sequential scheduling on identical machines
• An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
• Scheduling on parallel identical machines with job-rejection and position-dependent processing times

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1704597)