Single facility multi-class job scheduling
From MaRDI portal
Considered is the problem of scheduling jobs belonging to different classes on a single facility. Jobs are differentiated on the basis of their set-up times. Further, jobs belonging to the same class may differ from each other by their processing times. The problem is to find a schedule that minimizes mean flow time. The authors propose two approaches. The first, enumerative one, is based on a dynamic programming method. The second, heuristic one, is analyzed from the viewpoint of its worst-case and mean behavior.
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
- A Dynamic Programming Approach for Sequencing Groups of Identical Jobs
- A Dynamic Programming Approach to Sequencing Problems
- Errata
- scientific article; zbMATH DE number 3754389 (Why is no real title available?)
- 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
(25)- Optimal schedules for single facility with two job classes
- Single facility scheduling with multiple job classes
- Scheduling two job classes on a single machine
- Local search procedures for improving feasible solutions to the sequential ordering problem
- One-machine batching and sequencing of multiple-type items
- Single facility scheduling with major and minor setups
- A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness
- Robust scheduling on a single machine to minimize total flow time
- Two-machine flowshop scheduling with job class setups to minimize total flowtime
- 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
- A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times
- Learning and forgetting effects on a group scheduling problem
- Approximation algorithms for problems in scheduling with set-ups
- Single machine scheduling with two job classes : minimizing maximum lateness
- Single machine scheduling to minimize the setup time and the earliness
- Single Facility Due Date Setting with Multiple Customer Classes
- Sequencing situations with just-in-time arrival, and related games
- An online algorithm for a problem in scheduling with set-ups and release times
- Dynamic programming algorithms for scheduling parallel machines with family setup times
- A heuristic approach for single-machine scheduling with due dates and class setups.
- Tradeoff between setup times and carrying costs for finished items
- Lexicographic column generation with a tree search pricing algorithm
- Metaheuristics for scheduling a non-permutation flowline manufacturing cell with sequence dependent family setup times
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)
