Reentrant open shop scheduling problem with time lags and no-wait constraints

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
The two-machine no-wait general and proportionate open shop makespan problem
Complexity results for flow-shop and open-shop scheduling problems with transportation delays
Scheduling two-machine no-wait open shops to minimize makespan
The two-machine open-shop problem with unit-time operations and time delays to minimize the makespan
A heuristic for the two-machine open-shop scheduling problem with transportation times
Two machine open shop scheduling problem to minimize an arbitrary machine usage regular penalty function
The two-machine open shop problem: To fit or not to fit, that is the question
Coupled task scheduling with exact delays: literature review and models
A cyclical search for the two machine flow shop and open shop to minimise finishing time
On-line two-machine open shop scheduling with time lags
Two-machine open shop problem with a single server and set-up time considerations
Two machines flow shop with reentrance and exact time lag
Two-machine open shop scheduling with special transportation times
Complexity of Scheduling Shops with No Wait in Process
Unit Execution Time Shop Problems
Open shop scheduling with delays
Open Shop Scheduling to Minimize Finish Time
Approximation Algorithms for Scheduling Problems with Exact Delays
Maximum matching and a polyhedron with 0,1-vertices
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
Handbook on Scheduling
Scheduling
NP-hardness of compact scheduling in simplified open and flow shops.

This page was built for publication: Reentrant open shop scheduling problem with time lags and no-wait constraints