Pages that link to "Item:Q3737197"

The following pages link to A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time (Q3737197):

Displaying 11 items.

• Exact algorithms for single-machine scheduling with time windows and precedence constraints (Q310349) (← links)
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
• Cellular control of manufacturing systems (Q1309976) (← links)
• Scheduling identical parallel machines to minimize total weighted completion time (Q1317043) (← links)
• Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
• An exact algorithm for the precedence-constrained single-machine scheduling problem (Q2355863) (← links)
• Exact solution procedures for the balanced unidirectional cyclic layout problem (Q2482739) (← links)
• An exact dynamic programming algorithm for the precedence-constrained class sequencing problem (Q2664413) (← links)
• Mathematical Modeling of Scheduling Problems (Q3354456) (← links)
• A branch and bound algorithm for the minimum storage-time sequencing problem (Q4434517) (← links)
• Formulating a scheduling problem with almost identical jobs by using positional completion times (Q5101423) (← links)