A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
From MaRDI portal
Publication:632684
DOI10.1016/j.cor.2010.12.010zbMath1208.90080OpenAlexW2054771140MaRDI QIDQ632684
Publication date: 25 March 2011
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.12.010
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (13)
Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration ⋮ Total tardiness minimization in permutation flowshop with deterioration consideration ⋮ A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine ⋮ Single-machine scheduling with learning and forgetting effects ⋮ Single-machine group scheduling problems with variable job processing times ⋮ Optimizing the supply chain configuration for make-to-order manufacturing ⋮ A makespan minimization problem for versatile developers in the game industry ⋮ Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect ⋮ Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning ⋮ A genetic algorithm-based approach for single-machine scheduling with learning effect and release time ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects ⋮ Solving a two-agent single-machine scheduling problem considering learning effect ⋮ A branch and bound algorithm to minimize the single machine maximum tardiness problem under effects of learning and deterioration with setup times
Cites Work
- Unnamed Item
- Single-machine scheduling problems with both deteriorating jobs and learning effects
- Some single-machine scheduling problems with general effects of learning and deterioration
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan
- A due-date assignment problem with learning effect and deteriorating jobs
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- Single-machine group scheduling problems with deteriorated and learning effect
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
- Single-machine scheduling with learning considerations
- Scheduling jobs under simple linear deterioration
- Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
- V-Shaped Policies for Scheduling 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 for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
