Parallel machine scheduling problems with proportionally deteriorating jobs
From MaRDI portal
Publication:3612784
DOI10.1080/00207720802095160zbMath1155.90376OpenAlexW2046933323MaRDI QIDQ3612784
Guoqing Wang, Mingbao Cheng, Longmin He
Publication date: 10 March 2009
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207720802095160
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (11)
Permutation flowshop scheduling with simple linear deterioration ⋮ Minimising makespan for two batch-processing machines with non-identical job sizes in job shop ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis ⋮ Dynamic performance and cost measures with setup determination under state-age-dependent deterioration ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Performance analysis of rotation schedule and improved strategy for open shop problem to minimise makespan ⋮ A new model and algorithm for uncertain random parallel machine scheduling problem ⋮ Single machine total completion time minimization scheduling with a time-dependent learning effect and deteriorating jobs ⋮ One-machine scheduling problems with deteriorating jobs and position-dependent learning effects under group technology considerations ⋮ Scheduling on parallel machines to minimise maximum lateness for the customer order problem
Cites Work
- The exact LPT-bound for maximizing the minimum completion time
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- A concise survey of scheduling with time-dependent processing times
- Parallel machine scheduling with time dependent processing times
- Scheduling Deteriorating Jobs on a Single Processor
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds on Multiprocessing Timing Anomalies
This page was built for publication: Parallel machine scheduling problems with proportionally deteriorating jobs
