Pages that link to "Item:Q2384909"
From MaRDI portal
The following pages link to Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909):
Displaying 11 items.
- Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility (Q732893) (← links)
- Solving the unconstrained optimization problem by a variable neighborhood search (Q864633) (← links)
- Variable neighbourhood search: methods and applications (Q970194) (← links)
- Setting a common due date in a constrained flowshop: a variable neighbourhood search approach (Q976037) (← links)
- Variable neighbourhood search: Methods and applications (Q1029572) (← links)
- On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
