Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties
From MaRDI portal
Publication:638880
DOI10.1016/j.apm.2011.01.005zbMath1221.90051OpenAlexW2084789769MaRDI QIDQ638880
Ji-Bo Wang, Xue-Ru Wang, Xue Huang
Publication date: 16 September 2011
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.01.005
Related Items
Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ A comparison of mixed-integer linear programming models for workforce scheduling with position-dependent processing times ⋮ Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance ⋮ Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning ⋮ Parallel-machine scheduling with non-simultaneous machine available time ⋮ Single-machine scheduling problems with an actual time-dependent deterioration ⋮ Minimizing the total waiting time of intermediate products in a manufacturing process ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ Single-machine ready times scheduling with group technology and proportional linear deterioration ⋮ An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs ⋮ Flow shop scheduling problem with position-dependent processing times ⋮ Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times
Cites Work
- Algorithm for minimizing weighted earliness penalty in single-machine problem
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines
- Scheduling deteriorating jobs subject to job or machine availability constraints
- Time-dependent scheduling
- Learning effect and deteriorating jobs in the single machine scheduling problems
- A note on single-machine scheduling with decreasing time-dependent job processing times
- A due-date assignment problem with learning effect and deteriorating jobs
- Single machine scheduling with decreasing linear deterioration under precedence constraints
- Scheduling jobs under decreasing linear deterioration
- Single machine scheduling to minimize weighted earliness subject to no tardy jobs
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment
- Complexity of scheduling tasks with time-dependent execution times
- A concise survey of scheduling with time-dependent processing times
- Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times
- 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
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
- Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
- Scheduling with time dependent processing times: Review and extensions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Due-date assignment and single machine scheduling with deteriorating jobs
- Flow shop scheduling problems with deteriorating jobs under dominating machines
