A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects

DOI10.1016/J.INS.2013.07.026MaRDI QIDQ497951zbMATH OpenOpenAlexFDO

Authors Yunqiang Yin, Wen-Hung Wu, Wen-Hsiang Wu, Chin-Chia 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

zbMATH Keywords

learning effectschedulingsingle-machinetardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The single-machine total weighted tardiness scheduling problem with position-based learning effects
• Scheduling with a position-weighted learning effect and job release dates
• Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates
• A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
• Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect

Cites work

• A bi-criterion single-machine scheduling problem with learning considerations
• A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• A decomposition algorithm for the single machine total tardiness problem
• A due-date assignment problem with learning effect and deteriorating jobs
• A new approach to the learning effect: Beyond the learning curve restrictions
• A revision of machine scheduling problems with a general learning effect
• A state-of-the-art review on scheduling with learning effects
• An artificial bee colony algorithm for the maximally diverse grouping problem
• scientific article; zbMATH DE number 40477 (Why is no real title available?)
• scientific article; zbMATH DE number 3550186 (Why is no real title available?)
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Minimizing total tardiness on a single machine with unequal release dates
• Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
• On decomposition of the total tardiness problem
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Scheduling jobs with position-dependent processing times
• Single machine multiple common due dates scheduling with learning effects
• Single machine scheduling with learning effect considerations
• Single-machine and two-machine flowshop scheduling with general learning functions
• Single-machine group scheduling with a time-dependent learning effect
• Single-machine scheduling problems with a learning effect
• Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption
• Single-machine scheduling with learning considerations
• Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
• Solution of the single machine total tardiness problem
• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
• Some scheduling problems with general position-dependent and time-dependent learning effects
• 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
• The two-machine total completion time flow shop problem
• Using artificial bees to solve partitioning and scheduling problems in codesign

Cited in

(21)

• 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 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
• The single-machine total weighted tardiness scheduling problem with position-based learning effects
• Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints
• 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
• 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
• 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
• Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates
• 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
• A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
• Permutation flow shop scheduling with makespan objective and truncated learning effects
• Research on two-machine flow shop scheduling problem with release dates and truncated learning effects
• Minimizing total tardiness for the single-machine identical-jobs order scheduling problem with a learning effect

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497951)