The scheduling problem where multiple machines compete for a common local buffer

DOI10.1016/0377-2217(93)E0352-XzbMath0927.90050OpenAlexW2064094328MaRDI QIDQ1127173

Inder Khosla

Publication date: 13 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0352-x

zbMATH Keywords

multiple machinesrestricted buffer spacescheduling jobshopssum of weighted completion timestwo-stage flowshop

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers ⋮ Scheduling batches in flowshop with limited buffers in the shampoo industry ⋮ A sequencing approach for creating new train timetables

Cites Work

• Unnamed Item
• Simultaneous Resource Scheduling to Minimize Weighted Flow Times
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Flowshop scheduling with limited temporary storage
• Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
• Surrogate Mathematical Programming

This page was built for publication: The scheduling problem where multiple machines compete for a common local buffer