Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed

DOI10.1016/J.COR.2019.04.017MaRDI QIDQ2003555zbMATH OpenOpenAlexWikidataFDO

Authors Jorge M. S. Valente, Jeffrey E. Schaller

Publication date 9 July 2019

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL http://repositorio.inesctec.pt/handle/123456789/12164

zbMATH Keywords

branch-and-boundearliness and tardinessflow shopscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags
• Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of j
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Minimizing total tardiness in permutation flowshops
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops

Cites work

• A comparison of lower bounds for the single-machine early/tardy problem
• A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• Benchmarks for basic scheduling problems
• Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of j
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
• Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers
• scientific article; zbMATH DE number 151905 (Why is no real title available?)
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Multicriteria scheduling
• Permutation flow shop scheduling with earliness and tardiness penalties
• Sequencing with Earliness and Tardiness Penalties: A Review
• Single-machine scheduling with early and tardy completion costs
• The two-machine flowshop scheduling problem with total tardiness

Cited in

(5)

• A branch and bound algorithm to minimise the total tardiness in the two-machine permutation flowshop scheduling problem with minimal time lags
• Accelerating the calculation of makespan used in scheduling improvement heuristics
• Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs
• Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders
• A systematic review of permutation flow shop scheduling with due-date-related objectives

This page was built for publication: Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed

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