Pages that link to "Item:Q1823851"

The following pages link to Single machine scheduling to minimize mean absolute lateness: A heuristic solution (Q1823851):

Displaying 8 items.

• Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
• A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems (Q1278309) (← links)
• Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method (Q1291768) (← links)
• Single machine scheduling to minimize weighted earliness subject to maximum tardiness (Q1373894) (← links)
• Machine scheduling with earliness, tardiness and non-execution penalties (Q1886873) (← links)
• Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem (Q1893607) (← links)
• A branch and bound approach for single machine scheduling with earliness and tardiness penalties (Q1963033) (← links)
• A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)