The following pages link to (Q3820362):
Displaying 25 items.
- New effective MILP models for PFSPs arising from real applications (Q301126) (← links)
- MILP models for the optimization of real production lines (Q302141) (← links)
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
- Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint (Q1640598) (← links)
- On the exact solution of the no-wait flow shop problem with due date constraints (Q1652232) (← links)
- A branch and price algorithm to solve the integrated production planning and scheduling in bulk ports (Q1751727) (← links)
- Mathematical models for preemptive shop scheduling problems (Q1762150) (← links)
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan (Q1787748) (← links)
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← links)
- Two-machine flowshop scheduling with a secondary criterion (Q1870802) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
- Mixed binary integer programming formulations for the reentrant job shop scheduling problem (Q2485171) (← links)
- Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs (Q2514766) (← links)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
- Multicriteria scheduling problems: a survey (Q2773166) (← links)
- Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness (Q2958669) (← links)
- A study of integer programming formulations for scheduling problems (Q3124684) (← links)
- Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814) (← links)
- Scheduling tasks on moving executors to minimise the maximum lateness (Q5937357) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
