Pages that link to "Item:Q1870834"
From MaRDI portal
The following pages link to Parallel machine earliness and tardiness scheduling with proportional weights (Q1870834):
Displayed 19 items.
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times (Q336752) (← links)
- Minimizing weighted earliness-tardiness on parallel machines using hybrid metaheuristics (Q337323) (← links)
- Dynamic routing strategies for JIT production in hybrid flow shops (Q339696) (← links)
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach (Q520264) (← links)
- A united search particle swarm optimization algorithm for multiobjective scheduling problem (Q611608) (← links)
- Batch sizing and just-in-time scheduling with common due date (Q744646) (← links)
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration (Q1010295) (← links)
- Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- Exact and approximate approaches for the Pareto front generation of the single path multicommodity flow problem (Q1615965) (← links)
- Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning (Q1762118) (← links)
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094) (← links)
- A multi-agent system for the weighted earliness tardiness parallel machine problem (Q2257353) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- A multi-objective optimization for preemptive identical parallel machines scheduling problem (Q2403115) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- Just-in-Time Scheduling with Equal-Size Jobs (Q2958671) (← links)
- Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem (Q6070981) (← links)
- Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost (Q6105902) (← links)