Pages that link to "Item:Q4651708"
From MaRDI portal
The following pages link to Analysis of algorithms for two‐stage flowshops with multi‐processor task flexibility (Q4651708):
Displaying 11 items.
- Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints (Q814116) (← links)
- A multi-stage parallel-processor flowshop problem with minimum flowtime (Q1197966) (← links)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
- A study of the multi-stage flowshop scheduling problem with alternative operation assignments (Q1613997) (← links)
- Flow-shop scheduling with flexible processors (Q1891241) (← links)
- A two-stage semi-hybrid flowshop problem in graphics processing (Q2501418) (← links)
- Two-machine shop scheduling: Compromise between flexibility and makespan value (Q2566711) (← links)
- A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs (Q2637353) (← links)
- A note on scheduling alternative operations in two-machine flowshops (Q3157717) (← links)
- A computational study of heuristics for two-stage flexible flowshops (Q4230155) (← links)
- Asymptotically optimal linear time algorithms for two-stage and three-stage flexible flow shops (Q4487091) (← links)
