Pages that link to "Item:Q4180114"
From MaRDI portal
The following pages link to The Complexity of Flowshop and Jobshop Scheduling (Q4180114):
Displaying 11 items.
- An exact parallel method for a bi-objective permutation flowshop problem (Q857297) (← links)
- Parallel partitioning method (PPM): A new exact method to solve bi-objective problems (Q869006) (← links)
- Heuristic algorithms for the minmax regret flow-shop problem with interval processing times (Q1642853) (← links)
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey (Q1765094) (← links)
- On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties (Q1765543) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- The nonpermutation flowshop scheduling problem: adjustment and bounding procedures (Q2336283) (← links)
- Fair optimization and networks: a survey (Q2336590) (← links)
- Applying tabu search to the job-shop scheduling problem (Q2367003) (← links)
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems (Q2379522) (← links)
- Local search heuristics for two-stage flow shop problems with secondary criterion (Q5955475) (← links)
