Approximation algorithms for problems in scheduling with set-ups

DOI10.1016/J.DAM.2007.08.010MaRDI QIDQ2476258zbMATH OpenOpenAlexFDO

Authors Srikrishnan Divakaran, Michael Saks

Publication date 18 March 2008

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2007.08.010

zbMATH Keywords

analysis of algorithmsapproximation algorithmsbatch schedulingoperations researchscheduling with set-ups

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• scientific article; zbMATH DE number 4158357
• An online algorithm for a problem in scheduling with set-ups and release times
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• A heuristic for preemptive scheduling with set-up times
• scientific article; zbMATH DE number 6678450

Cites work

• A polynomial-time approximation scheme for single-machine sequencing with delivery times and sequence-independent batch set-up times
• An online algorithm for a problem in scheduling with set-ups and release times
• Approximation algorithms for problems in scheduling with set-ups
• Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times
• Batch scheduling to minimize total completion time
• Branch and bound algorithms for single-machine scheduling with batch set-up times to minimize total weighted completion time
• Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs
• scientific article; zbMATH DE number 3632203 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1306855 (Why is no real title available?)
• scientific article; zbMATH DE number 10435 (Why is no real title available?)
• Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
• Minimizing maximum lateness with job families
• On the Complexity of Scheduling with Batch Setup Times
• Scheduling Groups of Jobs on a Single Machine
• Scheduling with batching: A review
• Single facility multi-class job scheduling
• Single facility scheduling with multiple job classes
• Single machine scheduling with batch set-up times to minimize maximum lateness
• Single-Machine Scheduling with Release Dates, Due Dates and Family Setup Times
• Solving a Class Scheduling Problem with a Genetic Algorithm

Cited in

(14)

• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Splitting versus setup trade-offs for scheduling to minimize weighted completion time
• An algebraic geometry algorithm for scheduling in presence of setups and correlated demands
• Approximation algorithms for problems in scheduling with set-ups
• Online machine scheduling with family setups
• scientific article; zbMATH DE number 6678450 (Why is no real title available?)
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem
• Approximating weighted completion time for order scheduling with setup times
• Non-preemptive scheduling on machines with setup times
• Survey of scheduling research involving setup times
• On Approximation Algorithms for Two-Stage Scheduling Problems
• Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions
• An online algorithm for a problem in scheduling with set-ups and release times
• Approximation algorithms for scheduling with reservations

This page was built for publication: Approximation algorithms for problems in scheduling with set-ups

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