Scheduling tasks with sequence-dependent processing times

DOI<177::AID-NAV3220350203>3.0.CO;2-V 10.1002/1520-6750(198804)35:2<177::AID-NAV3220350203>3.0.CO;2-VzbMath0643.90033OpenAlexW2012251361MaRDI QIDQ3786260

Giovanni Rinaldi, Antonio Sassano, Salvatore Ricciardelli, Lucio Bianco

Publication date: 1988

Full work available at URL: https://doi.org/10.1002/1520-6750(198804)35:2<177::aid-nav3220350203>3.0.co;2-v

zbMATH Keywords

branch-and-boundsingle machinelower boundsasymmetric traveling salesmandominance criteriaminimal completion time

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35)

Related Items

Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations ⋮ A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan ⋮ Scheduling models for air traffic control in terminal areas ⋮ The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ Solving the single crane scheduling problem at rail transshipment yards ⋮ An efficient genetic algorithm with uniform crossover for air traffic control ⋮ A heuristic approach for single-machine scheduling with due dates and class setups. ⋮ A bicriteria scheduling with sequence-dependent setup times ⋮ Low-complexity algorithms for sequencing jobs with a fixed number of job-classes ⋮ A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times