Pages that link to "Item:Q835561"

The following pages link to Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561):

Displaying 10 items.

• 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)
• Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval (Q726392) (← links)
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times (Q892912) (← links)
• A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
• Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times (Q2004709) (← links)
• A survey of scheduling with controllable processing times (Q2381529) (← links)
• Single-machine batch scheduling problem with job rejection and resource dependent processing times (Q4553872) (← links)