Identical parallel machine scheduling with time-dependent processing times
From MaRDI portal
Publication:1704597
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
Recommendations
makespanparallel machine schedulingheuristic methodslexicographic searchsimple deteriorating jobstwo-machine-optimal algorithm
Cites Work
- An Application of Bin-Packing to Multiprocessor Scheduling
- Time-dependent scheduling
- NP-hard cases in scheduling deteriorating jobs on dedicated machines
- A concise survey of scheduling with time-dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Parallel-machine scheduling of simple linear deteriorating jobs
- Title not available (Why is that?)
- Multi-Machine Scheduling With Linear Deterioration
- Parallel machine scheduling with time dependent processing times
- Approximation algorithms for parallel machine scheduling with linear deterioration
- Parallel-machine scheduling with deteriorating jobs and rejection
- Unrelated parallel machines scheduling with deteriorating jobs and resource dependent processing times
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines
- An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs
Cited In (11)
- Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop
- Interval scheduling on identical machines
- Parallel Processing and Applied Mathematics
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms
- Scheduling jobs with equal processing times and a single server on parallel identical machines
- Scheduling identical parallel machines with tooling constraints
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
- An approximation algorithm for identical parallel machine scheduling with resource dependent processing times
- Sequential scheduling on identical machines
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)
