Single machine batch scheduling to minimize total completion time and resource consumption costs

DOI10.1007/s10951-007-0025-9zbMath1168.90469OpenAlexW2056881568MaRDI QIDQ835561

George Steiner, Dvir Shabtay

Publication date: 28 August 2009

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-007-0025-9

zbMATH Keywords

optimizationresource allocationsingle machine scheduling

Mathematics Subject Classification ID

Nonlinear programming (90C30) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost ⋮ A survey of scheduling with controllable processing times ⋮ Single-machine batch scheduling problem with job rejection and resource dependent processing times ⋮ Serial batch scheduling on uniform parallel machines to minimize total completion time ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine ⋮ Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times ⋮ Bicriterion scheduling with a negotiable common due window and resource-dependent processing times ⋮ Optimal due date assignment and resource allocation in a group technology scheduling environment ⋮ Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval

Cites Work

• Unnamed Item
• Batch sizing and job sequencing on a single machine
• A survey of results for sequencing problems with controllable processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• A multi-objective approach to resource allocation in single machine scheduling
• Single-machine sequencing with controllable processing times
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single machine batch scheduling with jointly compressible setup and processing times.
• Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
• Single machine batch scheduling with deadlines and resource dependent processing times
• Scheduling with batching: A review
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Solving a class of two-resource allocation problem by equivalent load method
• Allocation of resources in project management
• Cost-effectiveness of a preventive counseling and support package for postnatal depression
• Scheduling Groups of Jobs on a Single Machine
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Single machine batch scheduling with resource dependent setup and processing times

This page was built for publication: Single machine batch scheduling to minimize total completion time and resource consumption costs