Pages that link to "Item:Q2490167"

The following pages link to Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167):

Displaying 24 items.

• Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
• Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
• Optimal restricted due date assignment in scheduling (Q322834) (← links)
• Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
• Due-window assignment problems with unit-time jobs (Q902534) (← links)
• Due dates assignment and JIT scheduling with equal-size jobs (Q976442) (← links)
• Parallel machine scheduling to minimize costs for earliness and number of tardy jobs (Q1315994) (← links)
• Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (Q1617277) (← links)
• Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs (Q1761111) (← links)
• Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
• Scheduling with common due date assignment to minimize generalized weighted earliness-tardiness penalties (Q2228360) (← links)
• Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← links)
• Solving integrated process planning, dynamic scheduling, and due date assignment using metaheuristic algorithms (Q2298093) (← links)
• Due-window assignment with identical jobs on parallel uniform machines (Q2355801) (← links)
• Solving the rectangular assignment problem and applications (Q2430614) (← links)
• Scheduling with due date assignment under special conditions on job processing (Q2434296) (← links)
• Due date assignments and scheduling a single machine with a general earliness/tardiness cost function (Q2459388) (← links)
• An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505) (← links)
• Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
• Due-date assignment with asymmetric earliness–tardiness cost (Q4661193) (← links)
• Scheduling unit processing time jobs on an <i>m</i>-machine flow-shop (Q4678245) (← links)
• A heuristic for single machine common due date assignment problem with different earliness/tardiness weights (Q6059906) (← links)
• Equitable scheduling on a single machine (Q6103750) (← links)