Pages that link to "Item:Q707000"
From MaRDI portal
The following pages link to Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000):
Displaying 10 items.
- A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services (Q297101) (← links)
- The lockmaster's problem (Q322695) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints (Q714856) (← links)
- Online scheduling with chain precedence constraints of equal-length jobs on parallel machines to minimize makespan (Q721932) (← links)
- Minimizing makespan for multi-spindle head machines with a mobile table (Q954031) (← links)
- Setting due dates to minimize the total weighted possibilistic mean value of the weighted earliness-tardiness costs on a single machine (Q2429059) (← links)
- On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan (Q2482805) (← links)
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost (Q2680241) (← links)
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times (Q3082645) (← links)
