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

DOI10.1007/S10951-007-0025-9zbMATH Open1168.90469OpenAlexW2056881568MaRDI QIDQ835561FDOQ835561

Authors: Dvir Shabtay, George Steiner 

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

Recommendations

• Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times
• Single machine batch scheduling with resource dependent setup and processing times
• Single machine batch scheduling with jointly compressible setup and processing times.
• Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs
• Scheduling a batching machine with convex resource consumption functions

zbMATH Keywords

optimizationresource allocationsingle machine scheduling

Mathematics Subject Classification ID

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

Cites Work

• 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
• A survey of results for sequencing problems with controllable processing times
• Allocation of resources in project management
• Scheduling Groups of Jobs on a Single Machine
• Single machine batch scheduling with resource dependent setup and processing times
• Batch sizing and job sequencing on a single machine
• A bicriterion approach to time/cost trade-offs in sequencing
• Single machine scheduling subject to deadlines and resource dependent processing times
• A multi-objective approach to resource allocation in single machine scheduling
• Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
• Single machine batch scheduling with deadlines and resource dependent processing times
• Single-machine sequencing with controllable 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
• Title not available (Why is that?)
• Solving a class of two-resource allocation problem by equivalent load method
• Cost-effectiveness of a preventive counseling and support package for postnatal depression

Cited In (19)

• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
• Single machine batch scheduling with deadlines and resource dependent processing times
• Single-machine batch scheduling problem with job rejection and resource dependent processing times
• Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs
• Single machine batch scheduling with jointly compressible setup and processing times.
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
• Single machine scheduling to minimize the setup time and the earliness
• A survey of scheduling with controllable processing times
• 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
• Batch scheduling with controllable setup and processing times to minimize total completion time
• Serial batch scheduling on uniform parallel machines to minimize total completion time
• Scheduling a batching machine with convex resource consumption functions
• Single machine batch scheduling with non-increasing time slot costs
• 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
• Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835561)