Frameworks for adaptable scheduling algorithms

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1099-1425(200001/02)3:1<21::AID-JOS33>3.0.CO;2-W" /><21::AID-JOS33>3.0.CO;2-W 10.1002/(SICI)1099-1425(200001/02)3:1<21::AID-JOS33>3.0.CO;2-WzbMath0966.90034OpenAlexW2005351998MaRDI QIDQ1976517

Webster, Scott

Publication date: 19 September 2000

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/(sici)1099-1425(200001/02)3:1<21::aid-jos33>3.0.co;2-w

zbMATH Keywords

productionscheduling algorithmsmaterial flowdesign of adaptable algorithms

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Cites Work

• Unnamed Item
• A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems
• Probabilistic Analysis and Practical Algorithms for the Flow Shop Weighted Completion Time Problem
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• The Lessons of Flowshop Scheduling Research
• Turnpike Optimality of Smith's Rule in Parallel Machines Stochastic Scheduling
• Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation
• Smart SMART Bounds for Weighted Response Time Scheduling
• A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date
• Scheduling a single batch processing machine with non-identical job sizes
• Scheduling independent tasks to reduce mean finishing time

This page was built for publication: Frameworks for adaptable scheduling algorithms