Single facility multi-class job scheduling

DOI10.1016/0305-0548(90)90003-PMaRDI QIDQ917435zbMATH OpenOpenAlexFDO

Authors Byong-Hun Ahn, Jae-Ho Hyun

Publication date 1990

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(90)90003-p

zbMATH Keywords

single machine schedulingmean flow timeworst-casemean behavior

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• Single facility scheduling with multiple job classes
• Optimal schedules for single facility with two job classes
• Single facility scheduling with major and minor setups
• A New Heuristic for a Single Machine Scheduling Problem with Set-up Times
• Single machine scheduling with two job classes : minimizing maximum lateness

Cites work

• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
• A Dynamic Programming Approach to Sequencing Problems
• Errata
• Minimizing maximum lateness on one machine: computational experience and some applications
• Optimal schedules for single facility with two job classes
• Single facility scheduling with multiple job classes

Cited in

(24)

• Single machine scheduling with two job classes : minimizing maximum lateness
• Tradeoff between setup times and carrying costs for finished items
• An online algorithm for a problem in scheduling with set-ups and release times
• A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
• Optimal schedules for single facility with two job classes
• A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
• Single Facility Due Date Setting with Multiple Customer Classes
• Dynamic programming algorithms for scheduling parallel machines with family setup times
• Single facility scheduling with multiple job classes
• Single machine scheduling to minimize the setup time and the earliness
• Scheduling with batching: A review
• Local search procedures for improving feasible solutions to the sequential ordering problem
• Sequencing situations with just-in-time arrival, and related games
• Lower bounds and algorithms for flowtime minimization on a single machine with set-up times
• Approximation algorithms for problems in scheduling with set-ups
• Two-machine flowshop scheduling with job class setups to minimize total flowtime
• Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
• Robust scheduling on a single machine to minimize total flow time
• One-machine batching and sequencing of multiple-type items
• Batch scheduling to minimize total completion time
• Scheduling two job classes on a single machine
• Single facility scheduling with major and minor setups
• Learning and forgetting effects on a group scheduling problem
• A heuristic approach for single-machine scheduling with due dates and class setups.

This page was built for publication: Single facility multi-class job scheduling

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