Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
From MaRDI portal
Publication:547127
DOI10.1016/j.cor.2010.11.014zbMath1215.90025OpenAlexW2155475734MaRDI QIDQ547127
Chou-Jung Hsu, Wen-Chiung Lee, Yi-Chi Huang, Cheng, T. C. Edwin
Publication date: 30 June 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.11.014
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Production models (90B30)
Related Items (18)
Single-machine bicriterion group scheduling with deteriorating setup times and job processing times ⋮ Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ Scheduling deteriorating jobs with a learning effect on unrelated parallel machines ⋮ Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity ⋮ The third comprehensive survey on scheduling problems with setup times/costs ⋮ Patient scheduling with periodic deteriorating maintenance on single medical device ⋮ Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration ⋮ Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time ⋮ Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing ⋮ Single-machine scheduling with accelerating deterioration effects ⋮ Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time ⋮ Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine ⋮ Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop ⋮ Scheduling with Deteriorating Jobs and Non-Simultaneous Machine Available Times ⋮ Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration ⋮ Single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs ⋮ A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times ⋮ MAKESPAN MINIMIZATION ON THREE-MACHINE FLOW SHOP WITH DETERIORATING JOBS
Cites Work
- Time-dependent scheduling
- Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration
- Learning effect and deteriorating jobs in the single machine scheduling problems
- Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan
- A concise survey of scheduling with time-dependent processing times
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires
- Scheduling with batching: A review
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Single machine group scheduling under decreasing linear deterioration
- Single-machine group scheduling problems with deterioration consideration
- A survey of scheduling problems with setup times or costs
- Minimizing sum of completion times for batch scheduling of jobs with deteriorating processing times
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Multi-machine scheduling with deteriorating jobs and scheduled maintenance
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Parametric problem in scheduling theory
- A dual algorithm for the one-machine scheduling problem
- Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
- Survey of scheduling research involving setup times
- Λ-Shaped Policies to Schedule Deteriorating Jobs
This page was built for publication: Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
