Pages that link to "Item:Q1612004"

The following pages link to A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints (Q1612004):

Displaying 9 items.

• An improved on-line algorithm for scheduling on two unrestrictive parallel batch processing machines (Q957356) (← 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 note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times (Q1876151) (← links)
• Scheduling with or without precedence relations on a serial-batch machine to minimize makespan and maximum cost (Q2333219) (← links)
• A best possible deterministic on-line algorithm for minimizing makespan on parallel batch machines (Q2434270) (← links)
• A survey of scheduling problems with setup times or costs (Q2467249) (← links)
• When serial batch scheduling involves parallel batching decisions: a branch and price scheme (Q2669619) (← links)
• Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities (Q5270518) (← links)
• (Q5383745) (← links)