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.017zbMath1458.90355OpenAlexW2942489752WikidataQ128002723 ScholiaQ128002723MaRDI QIDQ2003555

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

schedulingbranch-and-boundflow shopearliness and tardiness

Mathematics Subject Classification ID

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

Related Items (2)

Accelerating the calculation of makespan used in scheduling improvement heuristics ⋮ Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders

Cites Work

• Unnamed Item
• Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness
• A comparison of lower bounds for the single-machine early/tardy problem
• The two-machine flowshop scheduling problem with total tardiness
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• Benchmarks for basic scheduling problems
• Multicriteria scheduling
• Permutation flow shop scheduling with earliness and tardiness penalties
• BEAM SEARCH HEURISTICS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH LINEAR EARLINESS AND QUADRATIC TARDINESS COSTS
• 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
• Sequencing with Earliness and Tardiness Penalties: A Review
• Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
• Single-machine scheduling with early and tardy completion costs

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