A note on single-machine scheduling with decreasing time-dependent job processing times
From MaRDI portal
Publication:967802
DOI10.1016/j.apm.2009.04.018zbMath1185.90098OpenAlexW2152674480MaRDI QIDQ967802
Publication date: 2 May 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2009.04.018
Related Items (7)
Multiple-machine scheduling with learning effects and cooperative games ⋮ Two-agent scheduling of time-dependent jobs ⋮ A single-machine scheduling problem with two-agent and deteriorating jobs ⋮ Single-machine group scheduling with general deterioration and learning effects ⋮ Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ Considerations of single-machine scheduling with deteriorating jobs
Cites Work
- Unnamed Item
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration
- 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
- Scheduling jobs under decreasing linear deterioration
- Time-optimal control in a single machine problem with resource constraints
- 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
- Complexity of scheduling tasks with time-dependent execution times
- A concise survey of scheduling with time-dependent processing times
- Single machine scheduling problems with deteriorating jobs
- 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
- Scheduling in a contaminated area: a model and polynomial algorithms
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
- Scheduling with time dependent processing times: Review and extensions
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Resource optimal control in some single-machine scheduling problems
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Flow shop scheduling problems with deteriorating jobs under dominating machines
This page was built for publication: A note on single-machine scheduling with decreasing time-dependent job processing times
