Pages that link to "Item:Q4279270"
From MaRDI portal
The following pages link to The parallel machine min-max weighted absolute lateness scheduling problem (Q4279270):
Displaying 26 items.
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach (Q856080) (← links)
- Maximizing weighted number of just-in-time jobs on unrelated parallel machines (Q880513) (← links)
- Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs (Q1268191) (← links)
- Scheduling with batch setup times and earliness-tardiness penalties (Q1278527) (← links)
- Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness (Q1296374) (← links)
- A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems (Q1310018) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- The weighted fair sequences problem (Q1652547) (← links)
- Scheduling job classes on uniform machines (Q1761112) (← links)
- Single machine scheduling to minimize the number of early and tardy jobs (Q1919786) (← links)
- Scheduling with a common due-window: polynomially solvable cases (Q2269806) (← links)
- An iterated min-max procedure for practical workload balancing on non-identical parallel machines in manufacturing systems (Q2312337) (← links)
- Minimizing total tardiness in a scheduling problem with a learning effect (Q2466609) (← links)
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505) (← links)
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling (Q3335507) (← links)
- Weighted-Tardiness Scheduling on Parallel Machines with Proportional Weights (Q3981510) (← links)
- Parallel machine scheduling with eligibility constraints: A composite dispatching rule to minimize total weighted tardiness (Q4632972) (← links)
- Due-date assignment with asymmetric earliness–tardiness cost (Q4661193) (← links)
- Hierarchical production planning and scheduling in a multi-product, batch process environment (Q5444475) (← links)
- Minmax earliness-tardiness costs with unit processing time jobs (Q5937720) (← links)
- A common due-data assignment problem on parallel identical machines (Q5953163) (← links)
- Parallel machine scheduling with a common due window (Q5953340) (← links)
