Scheduling tasks with sequence-dependent processing times

DOI10.1002/1520-6750(198804)35:2%3C177::AID-NAV3220350203%3E3.0.CO;2-VMaRDI QIDQ3786260zbMATH OpenOpenAlexFDO

Authors Salvatore Ricciardelli, G. Rinaldi, Antonio Sassano, Lucio Bianco

Publication date 1988

Full work available at URL https://doi.org/10.1002/1520-6750(198804)35:2%3C177::aid-nav3220350203%3E3.0.co;2-v

zbMATH Keywords

lower boundssingle machinebranch-and-boundasymmetric traveling salesmandominance criteriaminimal completion time

Mathematics Subject Classification ID

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

Recommendations

• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Minimizing total completion time subject to release dates and sequence-dependent processing times
• Scheduling deteriorating jobs on a single machine to minimize the maximum processing times
• Scheduling with release dates on a single machine to minimize total weighted completion time
• Scheduling start time dependent jobs to minimize the total weighted completion time

Cited in

(20)

• Optimal scheduling of progressive processing tasks
• Exact and heuristic algorithms for minimizing the makespan on a single machine scheduling problem with sequence-dependent setup times and release dates
• scientific article; zbMATH DE number 4080896 (Why is no real title available?)
• Approximate sequencing for variable length tasks.
• Domino sequencing: scheduling with state-based sequence-dependent setup times
• A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• An efficient genetic algorithm with uniform crossover for air traffic control
• CHAIN STRUCTURES IN SCHEDULES TASKS
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
• Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations
• Scheduling models for air traffic control in terminal areas
• Sequence-dependent scheduling with order deliveries
• The traveling salesman problem with job-times (\textit{TSPJ})
• A beam search heuristic for scheduling a single machine with release dates and sequence dependent setup times to minimize the makespan
• A bicriteria scheduling with sequence-dependent setup times
• Fair Hitting Sequence Problem: scheduling activities with varied frequency requirements
• Solving the single crane scheduling problem at rail transshipment yards
• A heuristic approach for single-machine scheduling with due dates and class setups.
• Scheduling jobs with varying processing times

This page was built for publication: Scheduling tasks with sequence-dependent processing times

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