Pages that link to "Item:Q3055278"
From MaRDI portal
The following pages link to Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278):
Displaying 8 items.
- Efficient constructive and composite heuristics for the permutation flowshop to minimise total earliness and tardiness (Q342504) (← links)
- An efficient local search for minimizing completion time variance in permutation flow shops (Q1762072) (← links)
- Heuristic and exact algorithms for the two-machine just in time job shop scheduling problem (Q1793464) (← links)
- Branch-and-bound algorithms for minimizing total earliness and tardiness in a two-machine permutation flow shop with unforced idle allowed (Q2003555) (← links)
- A filtered beam search method for the \(m\)-machine permutation flowshop scheduling problem minimizing the earliness and tardiness penalties and the waiting time of the jobs (Q2337385) (← links)
- Using hybrid GA-PSO algorithm to solve problem in machine scheduling (Q5035071) (← links)
- Solving non-permutation flow-shop scheduling problem via a novel deep reinforcement learning approach (Q6109307) (← links)
- Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window (Q6164365) (← links)
