Pages that link to "Item:Q3055285"

The following pages link to New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285):

Displaying 10 items.

• Total completion time with makespan constraint in no-wait flowshops with setup times (Q296867) (← links)
• On no-wait and no-idle flow shops with makespan criterion (Q859679) (← links)
• Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion (Q976399) (← 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)
• No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan (Q2284308) (← links)
• A new heuristic and dominance relations for no-wait flowshops with setups (Q5936136) (← links)
• No-Wait Flow Shop scheduling problem: a systematic literature review and bibliometric analysis (Q6127701) (← links)
• A novel iterated greedy algorithm for no-wait permutation flowshop scheduling to minimize weighted quadratic tardiness (Q6193912) (← links)
• A reactive iterated greedy algorithm for the no-wait flowshop to minimize total tardiness (Q6574085) (← links)