Pages that link to "Item:Q5194747"
From MaRDI portal
The following pages link to An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines (Q5194747):
Displaying 11 items.
- Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors (Q1372768) (← links)
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm (Q1725624) (← links)
- TOPSIS method for teaching effect evaluation of College English with interval-valued intuitionistic fuzzy information (Q2036018) (← links)
- Due-window assignment scheduling with learning and deterioration effects (Q2086934) (← links)
- Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855) (← links)
- A branch-and-price algorithm for parallel machine campaign planning under sequence dependent family setups and co-production (Q2669527) (← links)
- An Improved Branch-Cut-and-Price Algorithm for Parallel Machine Scheduling Problems (Q5139849) (← links)
- Unrelated Parallel Machine Scheduling with Job Splitting, Setup Time, Learning Effect, Processing Cost and Machine Eligibility (Q6053524) (← links)
- A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines (Q6060668) (← links)
- Efficient algorithms for flexible job shop scheduling with parallel machines (Q6093557) (← links)
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones (Q6130706) (← links)
