Pages that link to "Item:Q1373879"

The following pages link to Using tabu search to solve the common due date early/tardy machine scheduling problem (Q1373879):

Displaying 8 items.

• A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date (Q856323) (← links)
• A differential evolution approach for the common due date early/tardy job scheduling problem (Q941556) (← links)
• A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
• Minimizing earliness and tardiness penalties in a single-machine problem with a common due date (Q1887879) (← links)
• Reducing tardy jobs by integrating process planning and scheduling functions (Q3055274) (← links)
• A heuristic approach to bicriteria scheduling (Q4934193) (← links)
• Multiple machine JIT scheduling: a tabu search approach (Q5428715) (← links)
• Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due dates (Q5953167) (← links)