Pages that link to "Item:Q1296374"

The following pages link to Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness (Q1296374):

Displaying 8 items.

• Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
• A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
• Single machine scheduling with assignable due dates (Q1613425) (← links)
• Single machine scheduling to minimize total weighted tardiness (Q1772846) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
• The parallel machine min-max weighted absolute lateness scheduling problem (Q4279270) (← links)
• Scheduling dedicated jobs with variative processing times (Q5963650) (← links)
• Single machine scheduling with assignable due dates to minimize maximum and total late work (Q6167395) (← links)