Pages that link to "Item:Q2282537"
From MaRDI portal
The following pages link to Flow shops with reentry: reversibility properties and makespan optimal schedules (Q2282537):
Displaying 8 items.
- Job scheduling of diffusion furnaces in semiconductor fabrication facilities (Q2140148) (← links)
- The reversibility property in a job-insertion tiebreaker for the permutational flow shop scheduling problem (Q2242240) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- Hybrid flow-shop manufacturing network reliability optimization using genetic algorithm and absorbing Markov chain (Q6072716) (← links)
- Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem (Q6164382) (← links)
- Makespan minimization in reentrant flow shop problem with identical jobs (Q6573405) (← links)
- Permutation flow shop scheduling with makespan objective and truncated learning effects (Q6586108) (← links)
- Robust scheduling in a two-machine re-entrant flow shop to minimise the value-at-risk of the makespan: branch-and-bound and heuristic algorithms based on Markovian activity networks and phase-type distributions (Q6588502) (← links)
