Pages that link to "Item:Q811886"
From MaRDI portal
The following pages link to Flowshop/no-idle scheduling to minimize total elapsed time (Q811886):
Displaying 14 items.
- A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
- The flow shop problem with no-idle constraints: a review and approximation (Q1027525) (← links)
- A new formulation and solution of the flowshop scheduling problem with no in-process waiting (Q1090230) (← links)
- Sequencing with restrictions in processing times (Q1393012) (← links)
- Minimizing total elapsed time subject to zero total idle time of machines in \(n\times 3\) flowshop problem. (Q1396238) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion (Q1788967) (← links)
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (Q1887766) (← links)
- New heuristics for total tardiness minimization in a flexible flowshop (Q1947616) (← links)
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines (Q2668758) (← links)
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion (Q2669719) (← links)
- A note on the flow-shop problem without interruptions in job processing (Q3320105) (← links)
- Minimizing Job Idleness in Deadline Constrained Environments (Q4015471) (← links)
- Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop (Q4273245) (← links)
