Single facility scheduling with multiple job classes

DOI10.1016/0377-2217(88)90252-4MaRDI QIDQ1105481zbMATH OpenOpenAlexFDO

Authors Jatinder N. D. Gupta

Publication date 1988

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(88)90252-4

zbMATH Keywords

heuristicmean flow timeone-machine schedulingswitching time

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Review text

The one-machine scheduling problem aiming at minimizing the mean flow time is considered. The jobs set is divided into K classes. The processing of a job from class s immediately after the processing of a job from class r requires switching time \(\alpha_{rs}>0\) \((\alpha_{rr}=0)\). A heuristic \(O(nK+n\) log n) algorithm is proposed, where n is the number of jobs. The author failed to establish the worst- case bound for the algorithm. The results of numerical experiments are reported.

Recommendations

• Single facility multi-class job scheduling
• Optimal schedules for single facility with two job classes
• Single facility scheduling with major and minor setups
• scientific article; zbMATH DE number 10435
• A New Heuristic for a Single Machine Scheduling Problem with Set-up Times

Cites work

• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• Errata
• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Optimal schedules for single facility with two job classes

Cited in

(21)

• Optimal schedules for single facility with two job classes
• Scheduling two job classes on a single machine
• Single facility scheduling with major and minor setups
• Robust scheduling on a single machine to minimize total flow time
• Heuristic methods for the identical parallel machine flowtime problem with set-up times
• Two-machine flowshop scheduling with job class setups to minimize total flowtime
• Heuristics for permutation flow shop scheduling with batch setup times
• Batch scheduling to minimize total completion time
• Scheduling with batching: A review
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
• Approximation algorithms for problems in scheduling with set-ups
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
• Using profit maximizing scheduling models to structure operational trade-offs and manufacturing strategy issues
• Single machine scheduling with two job classes : minimizing maximum lateness
• An improved heuristic for parallel machine weighted flowtime scheduling with family set-up times
• Single Facility Due Date Setting with Multiple Customer Classes
• Sequencing situations with just-in-time arrival, and related games
• scientific article; zbMATH DE number 1389747 (Why is no real title available?)
• An online algorithm for a problem in scheduling with set-ups and release times
• Tradeoff between setup times and carrying costs for finished items
• Single facility multi-class job scheduling

This page was built for publication: Single facility scheduling with multiple job classes

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