Pages that link to "Item:Q1991105"
From MaRDI portal
The following pages link to Online scheduling of ordered flow shops (Q1991105):
Displaying 7 items.
- Discrete and continuous-time formulations for dealing with break periods: preemptive and non-preemptive scheduling (Q1999390) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem (Q2273694) (← links)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
- Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates (Q5216799) (← links)
- Online scheduling with deterioration and unexpected processor breakdown (Q6047192) (← links)
