Multi-machine scheduling with general position-based deterioration to minimize total load revisited
From MaRDI portal
Publication:2448108
DOI10.1016/j.ipl.2014.02.009zbMath1296.68026OpenAlexW1992216074MaRDI QIDQ2448108
Kai Huang, Xian-Yu Yu, Yu-Lin Zhang
Publication date: 30 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2014.02.009
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (6)
Minimizing total load on parallel machines with linear deterioration ⋮ Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling ⋮ Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection ⋮ Multi-machine scheduling with interval constrained position-dependent processing times ⋮ Approximation algorithms for some position-dependent scheduling problems ⋮ Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
Cites Work
- Single-machine scheduling with past-sequence-dependent delivery times and a linear deterioration
- Scheduling with job-dependent learning effects and multiple rate-modifying activities
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan
- Single-machine scheduling with learning considerations
- Scheduling jobs under simple linear deterioration
- Scheduling with general job-dependent learning curves.
- Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
- Scheduling Deteriorating Jobs on a Single Processor
- Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling jobs with position-dependent processing times
- An extension of the Munkres algorithm for the assignment problem to rectangular matrices
- Single machine scheduling with learning effect considerations
This page was built for publication: Multi-machine scheduling with general position-based deterioration to minimize total load revisited