scientific article; zbMATH DE number 1416512

DOI10.1002/(SICI)1520-6750(199912)46:8%3C893::AID-NAV2%3E3.0.CO;2-7MaRDI QIDQ4943556zbMATH OpenFDO

Authors Paolo Dell'Olmo, Stefano Giordani, Lucio Bianco, Maria Grazia Speranza

Publication date 16 March 2000

Full work available at URL https://doi.org/10.1002/(SICI)1520-6750(199912)46:8%3C893::AID-NAV2%3E3.0.CO;2-7

zbMATH Keywords

dedicated processorsheuristic algorithmslower boundsmultiple modesshop scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Scheduling independent tasks with multiple modes
• Heuristics for multimode scheduling problems with dedicated resources
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• scientific article; zbMATH DE number 1271325
• Scheduling Multiprocessor Tasks to Minimize Schedule Length

Cites work

• scientific article; zbMATH DE number 226824 (Why is no real title available?)
• Project Scheduling with Discrete and Continuous Resources

Cited in

(7)

• Heuristics for multimode scheduling problems with dedicated resources
• Makespan minimization in job shops: a polynomial time approximation scheme
• scientific article; zbMATH DE number 176000 (Why is no real title available?)
• scientific article; zbMATH DE number 2230238 (Why is no real title available?)
• Scheduling wagons to unload in bulk cargo ports with uncertain processing times
• A new approach for scheduling independent tasks with multiple modes
• Mass customization in videotape duplication and conversion: challenges of flexible duplication systems, fast delivery, and electronic service

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4943556)