Pages that link to "Item:Q1754153"
From MaRDI portal
The following pages link to Order scheduling with tardiness objective: improved approximate solutions (Q1754153):
Displaying 14 items.
- Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
- Deterministic assembly scheduling problems: a review and classification of concurrent-type scheduling models and solution procedures (Q1622791) (← links)
- Two-machine no-wait flowshop scheduling problem with uncertain setup times to minimize maximum lateness (Q1715728) (← links)
- Metaheuristics for order scheduling problem with unequal ready times (Q1727107) (← links)
- Tailoring customer order scheduling search algorithms (Q2003430) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- A matheuristic approach to large-scale avionic scheduling (Q2241154) (← links)
- No-wait flowshop scheduling problem with separate setup times to minimize total tardiness subject to makespan (Q2284308) (← links)
- A learning-based two-stage optimization method for customer order scheduling (Q2669593) (← links)
- A new variable neighbourhood search with a constraint programming search strategy for the open shop scheduling problem with operation repetitions (Q6048209) (← links)
- A constraint programming-based iterated greedy algorithm for the open shop with sequence-dependent processing times and makespan minimization (Q6068709) (← links)
- An efficient iterated greedy algorithm for a multi-objective no-wait flow shop problem with sequence dependent setup times (Q6489312) (← links)
- Solving customer order scheduling problems with an iterated greedy algorithm (Q6606519) (← links)
- Minimizing the earliness-tardiness for the customer order scheduling problem in a dedicated machine environment (Q6657881) (← links)
