Pages that link to "Item:Q4047360"

The following pages link to Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory (Q4047360):

Displaying 12 items.

• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties (Q336376) (← links)
• Scheduling preparation of doses for a chemotherapy service (Q601167) (← links)
• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems (Q985311) (← links)
• A unified formulation of the machine scheduling problem (Q1245650) (← links)
• Four solution techniques for a general one machine scheduling problem. A comparative study (Q1247365) (← links)
• A survey of algorithms for the single machine total weighted tardiness scheduling problem (Q1262207) (← links)
• Scheduling unrelated parallel machines to minimize total weighted tardiness. (Q1413838) (← links)
• Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
• Mathematical Modeling of Scheduling Problems (Q3354456) (← links)
• A dual algorithm for the one-machine scheduling problem (Q4131996) (← links)