Pages that link to "Item:Q1600008"
From MaRDI portal
The following pages link to A new dynamic look-ahead scheduling procedure for batching machines (Q1600008):
Displaying 6 items.
- A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals (Q1762063) (← links)
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times (Q1781549) (← links)
- Decentralised, multi-objective driven scheduling for reentrant shops: a conceptual development and a test case (Q2566702) (← links)
- Solving single batch-processing machine problems using an iterated heuristic (Q3019221) (← links)
- Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance (Q3163712) (← links)
- Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead (Q5241278) (← links)
