A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
From MaRDI portal
Publication:2798129
DOI10.1051/RO/2015026zbMath1333.90054OpenAlexW2266317824MaRDI QIDQ2798129
Publication date: 1 April 2016
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2015026
Deterministic scheduling theory in operations research (90B35) Stochastic scheduling theory in operations research (90B36)
Cites Work
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
- Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Learning effect and deteriorating jobs in the single machine scheduling problems
- A note on single-machine group scheduling problems with position-based learning effect
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- Single-machine group scheduling problems with deteriorated and learning effect
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- Single-machine group scheduling problems with deterioration consideration
- Learning and forgetting effects on a group scheduling problem
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
- Single-machine group scheduling with a time-dependent learning effect
- Scheduling with time dependent processing times: Review and extensions
- Scheduling Deteriorating Jobs on a Single Processor
- Some scheduling problems with past sequence dependent setup times under the effects of nonlinear deterioration and time-dependent learning
- Single machine scheduling with a time-dependent learning effect and deteriorating jobs
- Scheduling start time dependent jobs to minimize the total weighted completion time
- Scheduling problems with a learning effect
This page was built for publication: A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
