Pages that link to "Item:Q1761111"
From MaRDI portal
The following pages link to Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs (Q1761111):
Displaying 15 items.
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
- Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness (Q319136) (← links)
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
- Multiple-machine scheduling with earliness, tardiness and completion time penalties (Q1302709) (← links)
- A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505) (← links)
- Minimizing the sum of job earliness and tardiness in a multimachine system (Q4245597) (← links)
- Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time (Q4661237) (← links)
- A heuristic for single machine common due date assignment problem with different earliness/tardiness weights (Q6059906) (← links)
