Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs

DOI10.1080/00207169908804760zbMath0917.90192OpenAlexW2050703803MaRDI QIDQ4243262

No author found.

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

zbMATH Keywords

earlinessgenetic algorithmstochastic schedulingtardiness

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimizing the expected weighted number of tardy jobs in stochastic flow shops
• Optimal assignment of slack due-dates and sequencing of jobs with random processing times on a single machine
• Sequencing jobs on a single machine with a common due data and stochastic processing times
• Scheduling to minimize weighted earliness and tardiness about a common due-date
• The stochastic single machine scheduling problem with earliness and tardiness costs
• Sequencing with Earliness and Tardiness Penalties: A Review
• Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• 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

This page was built for publication: Application of genetic algorithm to stochastic single machine scheduling problem with earliness and tardiness costs