A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert

DOI10.1016/J.AMC.2005.05.011zbMATH Open1092.90026OpenAlexW2075065265MaRDI QIDQ2490218FDOQ2490218

Authors: R. Tavakkoli-Moghaddam, G. Moslehi, M. Vasei, Amir Azaron 

Publication date: 28 April 2006

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2005.05.011

Recommendations

• A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
• Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
• A Branch-and-Bound Algorithm for Single-Machine Earliness–Tardiness Scheduling with Idle Time
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
• A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem

zbMATH Keywords

Single machineSequencingMaximum tardinessMaximum earlinessBranch-and-Bound methodIdle insert

Mathematics Subject Classification ID

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

Cites Work

• A knowledgeable simulated annealing scheme for the early/tardy flow shop scheduling problem
• A heuristic for the single machine tardiness problem
• Title not available (Why is that?)
• A Heuristic Algorithm for Sequencing on One Machine to Minimize Total Tardiness
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
• The Single Machine Early/Tardy Problem
• Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
• Optimal timing schedules in earliness-tardiness single machine sequencing
• A simulated annealing approach for the one-machine mean tardiness scheduling problem
• Algorithms for a class of single-machine weighted tardiness and earliness problems
• On the Single-machine Scheduling Problem with Tardiness Penalties
• A neighbourhood scheme with a compressed solution space for the early/tardy scheduling problem
• Common due date scheduling problem with separate earliness and tardiness penalties
• A tabu search approach for the single machine mean tardiness problem

Cited In (6)

• Optimal scheduling for a single machine to minimize the sum of maximum earliness and tardiness considering idle insert
• Multi-criteria sequencing problem for a mixed-model assembly line in a JIT production system
• A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
• Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
• Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
• Multi-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach

This page was built for publication: A branch-and-bound algorithm for a single machine sequencing to minimize the sum of maximum earliness and tardiness with idle insert

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