Pages that link to "Item:Q1876151"
From MaRDI portal
The following pages link to A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151):
Displaying 8 items.
- Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types (Q276548) (← links)
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
- Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (Q1413926) (← links)
- A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints (Q1752766) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Exact algorithms based on a constrained shortest path model for robust serial-batch and parallel-batch scheduling problems (Q6106966) (← links)
