Pages that link to "Item:Q2427185"
From MaRDI portal
The following pages link to A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem (Q2427185):
Displayed 14 items.
- List scheduling and beam search methods for the flexible job shop scheduling problem with sequencing flexibility (Q320008) (← links)
- Developing equilibrium optimization methods for hub location problems (Q521701) (← links)
- Mathematical models for job-shop scheduling problems with routing and process plan flexibility (Q988383) (← links)
- New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs (Q1044141) (← links)
- Solving the flexible job shop scheduling problem with sequence-dependent setup times (Q1681272) (← links)
- A worker constrained flexible job shop scheduling problem with sequence-dependent setup times (Q1733093) (← links)
- A new hybrid genetic algorithm for job shop scheduling problem (Q1761165) (← links)
- Metaheuristics for the online printing shop scheduling problem (Q2030284) (← links)
- Novel multi-objective resource allocation and activity scheduling for fourth party logistics (Q2257344) (← links)
- Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times (Q2428941) (← links)
- A MILP model for an extended version of the flexible job shop problem (Q2448209) (← links)
- A bi-objective turning restriction design problem in urban road networks (Q2514872) (← links)
- Mixed integer linear programming and constraint programming models for the online printing shop scheduling problem (Q2664355) (← links)
- Modelling and solving resource allocation problems via a dynamic programming approach (Q5157967) (← links)
