Pages that link to "Item:Q859679"

The following pages link to On no-wait and no-idle flow shops with makespan criterion (Q859679):

Displaying 24 items.

• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem (Q336357) (← links)
• Minimizing makespan for a no-wait flowshop using genetic algorithm (Q746438) (← links)
• The flow shop problem with no-idle constraints: a review and approximation (Q1027525) (← links)
• Applications of max-plus algebra to flow shop scheduling problems (Q1671348) (← links)
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan (Q1750472) (← links)
• A survey of scheduling problems with no-wait in process (Q1751258) (← links)
• A hybrid discrete differential evolution algorithm for the no-idle permutation flow shop scheduling problem with makespan criterion (Q1761140) (← 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)
• Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion (Q2099337) (← links)
• Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments (Q2250726) (← links)
• Analysis of flow shop scheduling anomalies (Q2272295) (← links)
• The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
• Three-stage ordered flow shops with either synchronous flow, blocking or no-idle machines (Q2305020) (← links)
• No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths (Q2327957) (← links)
• Processing element allocation and dynamic scheduling codesign for multi-function SoCs (Q2379860) (← links)
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness (Q2456478) (← links)
• Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← 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)
• Solvable Cases of the No-wait Flow-shop Scheduling Problem (Q3984309) (← links)
• No-wait flowshops with bicriteria of makespan and total completion time (Q4656717) (← links)
• Permutation, no-wait, no-idle flow shop problems (Q4971620) (← links)