Pages that link to "Item:Q284835"
From MaRDI portal
The following pages link to Multitasking via alternate and shared processing: algorithms and complexity (Q284835):
Displaying 12 items.
- On the optimization of multitasking process with multiplayer (Q1783243) (← links)
- Due date assignment and two-agent scheduling under multitasking environment (Q2084604) (← links)
- Streaming algorithms for multitasking scheduling with shared processing (Q2166248) (← links)
- Single-machine multitasking scheduling with job efficiency promotion (Q2168741) (← links)
- Fatigue, personnel scheduling and operations: review and research opportunities (Q2242368) (← links)
- Multitasking scheduling with alternate periods (Q2697142) (← links)
- Multitasking scheduling problems with two competitive agents (Q5059462) (← links)
- Streaming approximation scheme for minimizing total completion time on parallel machines subject to varying processing capacity (Q6039898) (← links)
- A branch‐and‐price approach to the multitasking scheduling with batch control on parallel machines (Q6060668) (← links)
- Multitasking scheduling with multiple rate‐modifying activities (Q6066633) (← links)
- A branch‐and‐price algorithm for identical parallel machine scheduling with multiple milestones (Q6130706) (← links)
- Multitasking scheduling with shared processing (Q6537208) (← links)