Pages that link to "Item:Q744632"
From MaRDI portal
The following pages link to A matheuristic approach for the two-machine total completion time flow shop problem (Q744632):
Displaying 15 items.
- Scheduling evacuation operations (Q309072) (← links)
- A hybrid heuristic approach for single machine scheduling with release times (Q336949) (← links)
- Integrating matheuristics and metaheuristics for timetabling (Q342465) (← links)
- A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- Three-machine flow shop scheduling with overlapping waiting time constraints (Q1628045) (← links)
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times (Q1733093) (← links)
- Order scheduling with tardiness objective: improved approximate solutions (Q1754153) (← links)
- An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814) (← links)
- Matheuristics for a parallel machine scheduling problem with non-anticipatory family setup times: application in the offshore oil and gas industry (Q2027046) (← links)
- Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation (Q2076840) (← links)
- A simple and effective algorithm for the maximum happy vertices problem (Q2121620) (← links)
- A multi-objective memetic algorithm for the job-shop scheduling problem (Q2359531) (← links)
- MILP-based local search procedures for minimizing total tardiness in the no-idle permutation flowshop problem (Q2676278) (← links)
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates (Q6066663) (← links)
