Pages that link to "Item:Q1413926"

The following pages link to On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. (Q1413926):

Displaying 11 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)
• The lockmaster's problem (Q322695) (← links)
• Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
• Scheduling a batch-processing machine subject to precedence constraints, release dates and identical processing times (Q707000) (← links)
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints (Q1612004) (← links)
• A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151) (← links)
• Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration (Q2022187) (← links)
• Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• On competitive analysis for polling systems (Q6072151) (← links)