Pages that link to "Item:Q2450667"

The following pages link to Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667):

Displaying 9 items.

• Ant colony systems for the single-machine total weighted earliness tardiness scheduling problem (Q282252) (← links)
• Inverse chromatic number problems in interval and permutation graphs (Q319198) (← links)
• Scheduling with time-dependent discrepancy times (Q1702735) (← links)
• Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution (Q1754012) (← links)
• Scheduling with generalized and periodic due dates under single- and two-machine environments (Q2115317) (← links)
• An application of unrelated parallel machine scheduling with sequence-dependent setups at Vestel Electronics (Q2273664) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Order Now, Pickup in 30 Minutes: Managing Queues with Static Delivery Guarantees (Q5106351) (← links)
• Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry (Q5257894) (← links)