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

DOI10.1016/0377-2217(93)E0352-XMaRDI QIDQ1127173zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Job-shop scheduling with limited capacity buffers
• A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE
• Flow shop with job-dependent buffer requirements -- a polynomial-time algorithm and efficient heuristics
• Flow-shop problems with intermediate buffers
• Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements

Cites work

• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• Flowshop scheduling with limited temporary storage
• Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
• Simultaneous Resource Scheduling to Minimize Weighted Flow Times
• Surrogate Mathematical Programming
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

Cited in

(10)

• Scheduling of a job-shop problem with limited output buffers
• Job-shop scheduling with limited capacity buffers
• Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
• Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach
• Lagrangian relaxation algorithms for real-time hybrid flowshop scheduling with finite intermediate buffers
• Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
• Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
• A sequencing approach for creating new train timetables
• Scheduling batches in flowshop with limited buffers in the shampoo industry

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

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