Conjugate problems in time-dependent scheduling
From MaRDI portal
Publication:1041348
DOI10.1007/s10951-009-0121-0zbMath1176.90212OpenAlexW2082878518MaRDI QIDQ1041348
Lidia Pankowska, Stanisław Gawiejnowicz, Wiesław Kurc
Publication date: 2 December 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-009-0121-0
Related Items
Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs ⋮ A memetic algorithm for minimizing the total weighted completion time on a single machine under linear deterioration ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ Scheduling time-dependent jobs under mixed deterioration ⋮ Isomorphic scheduling problems ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of scheduling starting time dependent tasks with release times
- Equivalent time-dependent scheduling problems
- Complexity of scheduling tasks with time-dependent execution times
- A note on scheduling on a single processor with speed dependent on a number of executed jobs
- A concise survey of scheduling with time-dependent processing times
- Minimizing the total weighted completion time of deteriorating jobs
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
- A state-of-the-art review on scheduling with learning effects
- Scheduling with time dependent processing times: Review and extensions
- General flow-shop scheduling with resource constraints
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Scheduling jobs with position-dependent processing times
- Scheduling of a Two-machine Flowshop with Processing Time Linearly Dependent on Job Waiting-time
