Heuristics for single machine scheduling problem with family setup times

DOI10.1504/IJCSM.2017.083755MaRDI QIDQ2224176zbMATH OpenFDO

Authors Yunfang Peng, Yajuan Han, Yuyan Xiao, Saif Ullah

Publication date 3 February 2021

Published in International Journal of Computing Science and Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJCSM.2017.083755

zbMATH Keywords

familyheuristic algorithmsetup timesingle machine schedulingtardiness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: Grouping of jobs from the same family on bottleneck resource is significant to reduce setup time of jobs. But, the grouping may result in delay of jobs. How to balance the contradiction between utilisation of bottleneck resource and delivery time is a great challenge in production scheduling. This paper considers a single machine scheduling problem in which each job to be scheduled belongs to a family and family setup times exist. This paper is aimed to identify a schedule of families of jobs to minimise total tardiness with respect to the given due dates of the jobs. A mathematical model is formulated for this problem and a heuristic solution approach is presented. Computational experiments show that the proposed heuristic algorithm performs better both in terms of solution quality and computational time.

Recommendations

• A single machine scheduling problem with family setup times
• Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times
• A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
• Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
• scientific article; zbMATH DE number 5631256
• Single machine scheduling with family setups to minimize total earliness and tardiness
• Minimizing L _max for the single machine scheduling problem with family set-ups
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• Single machine scheduling with sequence-dependent family setups to minimize maximum lateness

Cited in

(9)

• Effective IG heuristics for a single-machine scheduling problem with family setups and resource constraints
• Minimizing maximum tardiness on a single machine with family setup times and machine disruption
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• scientific article; zbMATH DE number 5631256 (Why is no real title available?)
• Minimizing L _max for the single machine scheduling problem with family set-ups
• scientific article; zbMATH DE number 1416517 (Why is no real title available?)
• ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness
• The fourth comprehensive review of scheduling problems with setup times
• Single machine batch scheduling problem with family setup times and release dates to minimize makespan

This page was built for publication: Heuristics for single machine scheduling problem with family setup times

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