Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times

DOI10.3934/NACO.2015.5.71MaRDI QIDQ2340165zbMATH OpenOpenAlexFDO

Authors Chengxin Luo

Publication date 16 April 2015

Published in Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.3934/naco.2015.5.71

zbMATH Keywords

convex optimizationmakespansingle-machine schedulingbatch partitionresource assumption

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Recommendations

• Single machine batch scheduling to minimize total completion time and resource consumption costs
• Batch scheduling with controllable setup and processing times to minimize total completion time
• Single machine scheduling problem with controllable processing time and setup under convex resource consumption costs
• Single machine batch scheduling with resource dependent setup and processing times
• Single machine batch scheduling with jointly compressible setup and processing times.

Cites work

• A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
• A survey of scheduling with controllable processing times
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling with batching: A review
• Single machine batch scheduling with resource dependent setup and processing times

Cited in

(13)

• Batch delivery scheduling with discretely controllable processing times
• Single machine scheduling with batch set-up times to minimize maximum lateness
• 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.
• Single machine batch scheduling problem with family setup times and release dates to minimize makespan
• Single machine batch scheduling to minimize total completion time and resource consumption costs
• Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times
• Batch scheduling of identical jobs with controllable processing times
• Minimizing makespan in batch machine scheduling
• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
• Scheduling a batching machine with convex resource consumption functions
• Batch scheduling with controllable setup and processing times to minimize total completion time
• Single machine batch scheduling problem with resource dependent setup and processing time in the presence of fuzzy due date

This page was built for publication: Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times

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