Single-machine group scheduling problems with deterioration to minimize the sum of completion times
From MaRDI portal
Publication:1954598
DOI10.1155/2012/275239zbMath1264.90091OpenAlexW2111661388WikidataQ58911367 ScholiaQ58911367MaRDI QIDQ1954598
Publication date: 11 June 2013
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/275239
Related Items (1)
Cites Work
- Single-machine group scheduling with general deterioration and learning effects
- Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Single-machine total completion time scheduling with a time-dependent deterioration
- Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning
- Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology
- A branch and bound algorithm for single machine scheduling with deteriorating values of jobs
- Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function
- Single machine scheduling with decreasing linear deterioration under precedence constraints
- A concise survey of scheduling with time-dependent processing times
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs
- Single-machine scheduling with time-and-resource-dependent processing times
- Scheduling Deteriorating Jobs on a Single Processor
This page was built for publication: Single-machine group scheduling problems with deterioration to minimize the sum of completion times
