Pages that link to "Item:Q835640"
From MaRDI portal
The following pages link to On-line scheduling on an unbounded parallel batch machine to minimize makespan of two families of jobs (Q835640):
Displaying 17 items.
- Online scheduling of equal-length jobs with incompatible families on multiple batch machines to maximize the weighted number of early jobs (Q436585) (← links)
- Online over time scheduling on parallel-batch machines: a survey (Q489147) (← links)
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility (Q490371) (← links)
- Online scheduling on unbounded parallel-batch machines with incompatible job families (Q533882) (← links)
- Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
- An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← links)
- Online scheduling on unbounded parallel-batch machines to minimize the makespan (Q990962) (← links)
- A best online algorithm for scheduling on two parallel batch machines (Q1019748) (← links)
- Online batch scheduling with kind release times and incompatible families to minimize makespan (Q1744626) (← links)
- Online scheduling of two-machine flowshop with lookahead and incompatible job families (Q2111531) (← links)
- Online scheduling of incompatible unit-length job families with lookahead (Q2250449) (← links)
- Online scheduling on two uniform unbounded parallel-batch machines to minimize makespan (Q2314063) (← links)
- Online scheduling on an unbounded parallel-batch machine and a standard machine to minimize makespan (Q2445903) (← links)
- An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan (Q2450605) (← links)
- (Q5115392) (← links)
- Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval (Q6053500) (← links)
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts (Q6112585) (← links)