Scheduling time-dependent jobs under mixed deterioration
From MaRDI portal
Publication:963924
DOI10.1016/j.amc.2010.01.037zbMath1188.90095OpenAlexW2071839775MaRDI QIDQ963924
Stanisław Gawiejnowicz, Bertrand M. T. Lin
Publication date: 14 April 2010
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.01.037
Related Items
Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs ⋮ Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration ⋮ Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect ⋮ Maximum cost scheduling of jobs with mixed variable processing times and \(k\)-partite precedence constraints ⋮ OL-DEC-MDP model for multiagent online scheduling with a time-dependent probability of success ⋮ Isomorphic scheduling problems ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ An uncertain parallel machine problem with deterioration and learning effect ⋮ Single Machine Two-Agent Scheduling with Deteriorating Jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scheduling jobs with varying processing times
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
- Batch scheduling of step deteriorating jobs
- Time-dependent scheduling
- Rescheduling problems with deteriorating jobs under disruptions
- Single machine parallel-batch scheduling with deteriorating jobs
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration
- Conjugate problems in time-dependent scheduling
- Equivalent time-dependent scheduling problems
- Scheduling jobs under simple linear deterioration
- Complexity of scheduling tasks with time-dependent execution times
- A concise survey of scheduling with time-dependent processing times
- Minimizing the total weighted completion time of deteriorating jobs
- Single machine scheduling problems with deteriorating jobs
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
- Scheduling with time dependent processing times: Review and extensions
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Technical Note—Minimizing a Function of Permutations of n Integers
- The NP-completeness column: An ongoing guide
- Minimizing maximum lateness under linear deterioration
