GENETIC ALGORITHMS FOR SINGLE MACHINE JOB SCHEDULING WITH COMMON DUE DATE AND SYMMETRIC PENALTIES
From MaRDI portal
Publication:4320146
Recommendations
- A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
- Variable parameters lengths genetic algorithm for minimizing earliness-tardiness penalties of single machine scheduling with a common due date
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
Cited in
(8)- Using genetic algorithms for single-machine bicriteria scheduling problems
- Metaheuristics: A bibliography
- A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- Minimizing flow time variance in a single machine system using genetic algorithms
- Variable parameters lengths genetic algorithm for minimizing earliness-tardiness penalties of single machine scheduling with a common due date
- An improved genetic algorithm for single machine scheduling problems with deteriorating jobs
- A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
This page was built for publication: GENETIC ALGORITHMS FOR SINGLE MACHINE JOB SCHEDULING WITH COMMON DUE DATE AND SYMMETRIC PENALTIES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4320146)