A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
From MaRDI portal
Publication:497951
DOI10.1016/j.ins.2013.07.026zbMath1321.90062OpenAlexW1971346010MaRDI QIDQ497951
Wen-Hsiang Wu, Chin-Chia Wu, Yunqiang Yin, Wen-Hung Wu
Publication date: 25 September 2015
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.07.026
Related Items (14)
Research on common due window assignment flowshop scheduling with learning effect and resource allocation ⋮ A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration ⋮ A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance ⋮ Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects ⋮ Multiple-machine scheduling with learning effects and cooperative games ⋮ A lower bound for minimizing the total completion time of a three-agent scheduling problem ⋮ A makespan minimization problem for versatile developers in the game industry ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ A genetic algorithm-based approach for single-machine scheduling with learning effect and release time ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ Research on scheduling problems with general effects of deterioration and learning ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
Cites Work
- Unnamed Item
- Unnamed Item
- A revision of machine scheduling problems with a general learning effect
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
- Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption
- A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
- Single machine multiple common due dates scheduling with learning effects
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- Single-machine and two-machine flowshop scheduling with general learning functions
- Using artificial bees to solve partitioning and scheduling problems in codesign
- A due-date assignment problem with learning effect and deteriorating jobs
- Single-machine scheduling problems with a learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- The single-machine total tardiness scheduling problem: review and extensions
- Single-machine scheduling with learning considerations
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- The two-machine total completion time flow shop problem
- Solution of the single machine total tardiness problem
- A decomposition algorithm for the single machine total tardiness problem
- A bi-criterion single-machine scheduling problem with learning considerations
- On decomposition of the total tardiness problem
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Minimizing total tardiness on a single machine with unequal release dates
- A state-of-the-art review on scheduling with learning effects
- A new approach to the learning effect: Beyond the learning curve restrictions
- Single-machine group scheduling with a time-dependent learning effect
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- An artificial bee colony algorithm for the maximally diverse grouping problem
- Scheduling jobs with position-dependent processing times
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Single machine scheduling with learning effect considerations
This page was built for publication: A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
