Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs
DOI10.1080/00207169908804760zbMATH Open0917.90192OpenAlexW2050703803MaRDI QIDQ4243262FDOQ4243262
Author name not available (Why is that?)
Publication date: 17 May 1999
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169908804760
Recommendations
- Minimizing earliness and tardiness costs in stochastic scheduling
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
- A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
- GENETIC ALGORITHMS FOR SINGLE MACHINE JOB SCHEDULING WITH COMMON DUE DATE AND SYMMETRIC PENALTIES
Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Sequencing with Earliness and Tardiness Penalties: A Review
- Sequencing jobs on a single machine with a common due data and stochastic processing times
- The stochastic single machine scheduling problem with earliness and tardiness costs
- Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates
- Scheduling to Minimize the Number of Late Jobs When Set-Up and Processing Times are Uncertain
- Minimizing the expected weighted number of tardy jobs in stochastic flow shops
- Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
- Title not available (Why is that?)
- Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
- Scheduling to minimize weighted earliness and tardiness about a common due-date
Cited In (5)
- Using genetic algorithms for single-machine bicriteria scheduling problems
- A Genetic Algorithm Approach to Solving Stochastic Job-shop Scheduling Problems
- A genetic algorithm for robust schedules in a one-machine environment with ready times and due dates
- A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties
- A new genetic algorithm for solving earliness/tardiness scheduling problem subjected to special process constraint
This page was built for publication: Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243262)
