Pages that link to "Item:Q1121779"

The following pages link to A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop (Q1121779):

Displaying 16 items.

• Minimizing the number of tardy jobs in a permutation flowshop scheduling problem with setup times and time lags constraints (Q367232) (← links)
• Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
• Two-machine interval shop scheduling with time lags (Q892834) (← links)
• Minimizing the number of late jobs for the permutation flowshop problem with secondary resources (Q941545) (← links)
• A new node selection strategy in the branch-and-bound procedure (Q1342946) (← links)
• Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849) (← links)
• Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic (Q1615940) (← links)
• A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779) (← links)
• A new rule for minimizing the number of tardy jobs in dynamic flow shops (Q1876177) (← links)
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation (Q1887965) (← links)
• Minimizing tardy jobs in a flowshop with common due date (Q1969838) (← links)
• Upper and lower bounds for the permutation flowshop scheduling problem with minimal time lags (Q2018863) (← links)
• Branch-relax-and-check: a tractable decomposition method for order acceptance and identical parallel machine scheduling (Q2189876) (← links)
• Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
• An effective Benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem (Q2664346) (← links)
• Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints (Q4921223) (← links)