Improved lower bounds for the early/tardy scheduling problem with no idle time
From MaRDI portal
Publication:5464436
DOI10.1057/palgrave.jors.2601865zbMath1095.90046OpenAlexW2048700543MaRDI QIDQ5464436
Jorge M. S. Valente, Rui A. F. S. Alves
Publication date: 17 August 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: http://repositorio.inesctec.pt/handle/123456789/3462
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (11)
Beam search for the longest common subsequence problem ⋮ A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties ⋮ Order acceptance with weighted tardiness ⋮ Minimizing total earliness and tardiness on a single machine using a hybrid heuristic ⋮ Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling ⋮ Extended beam search for non-exhaustive state space analysis ⋮ Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness ⋮ Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups ⋮ Heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties ⋮ On solving the assembly line worker assignment and balancing problem via beam search ⋮ A HYBRID GENETIC ALGORITHM FOR THE EARLY/TARDY SCHEDULING PROBLEM
This page was built for publication: Improved lower bounds for the early/tardy scheduling problem with no idle time
