Pages that link to "Item:Q2485329"
From MaRDI portal
The following pages link to Approximation schemes for job shop scheduling problems with controllable processing times (Q2485329):
Displaying 15 items.
- A decomposition approach to job-shop scheduling problem with discretely controllable processing times (Q412943) (← links)
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time (Q613775) (← links)
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems (Q626658) (← links)
- Double layer ACO algorithm for the multi-objective FJSSP (Q732169) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Scheduling jobs with time-resource tradeoff via nonlinear programming (Q1040086) (← links)
- Job-shop scheduling with processing alternatives. (Q1410614) (← links)
- Parallel machine scheduling with speed-up resources (Q1754306) (← links)
- Approximation schemes for parallel machine scheduling problems with controllable processing times (Q1885962) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- Schedule execution for two-machine flow-shop with interval processing times (Q2390053) (← links)
- Two-machine open shop problem with controllable processing times (Q2467128) (← links)
- Loading and scheduling for flexible manufacturing systems with controllable processing times (Q5058957) (← links)
- A linear time approximation scheme for the single machine scheduling problem with controllable processing times (Q5491459) (← links)
