Two-machine flow shop scheduling with convex resource consumption functions

DOI10.1007/S11590-022-01934-1MaRDI QIDQ6097489zbMATH OpenOpenAlexWikidataFDO

Authors Byung-Cheon Choi, Myoung-Ju Park

Publication date 5 June 2023

Published in Optimization Letters (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s11590-022-01934-1

zbMATH Keywords

approximation algorithmscomputational complexityconvex resource consumptionscheduling

Mathematics Subject Classification ID

Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
• On minimizing resource consumption with constraints on the makespan and the total completion time
• A permutation flow-shop scheduling problem with convex models of operation processing times

Cites work

• A new bounding mechanism for the CNC machine scheduling problems with controllable processing times
• A permutation flow-shop scheduling problem with convex models of operation processing times
• A survey of scheduling with controllable processing times
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Minimizing the total weighted flow time in a single machine with controllable processing times
• Parallel machine scheduling with a convex resource consumption function
• Principles of Sequencing and Scheduling
• Proportionate flow shop with controllable processing times
• Resource management in machine scheduling problems: a survey
• Single machine scheduling with total tardiness criterion and convex controllable processing times
• Single-machine scheduling with resource-dependent processing times and multiple unavailability periods

Cited in

(11)

• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Minimization of the makespan in a two-machine problem under given resource constraints
• Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
• Two-machine flow shop scheduling problem under linear constraints
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
• Bicriteria permutation flow shop scheduling problems with machine-dependent convex resource consumption functions
• Minimizing total completion time in single-machine scheduling with convex resource consumption and job rejection
• Fifty years of research in scheduling -- theory and applications
• Coordinating scheduling and resource allocation decisions in a proportionate flow-shop scheduling environment
• A preemptive single-machine scheduling problem with a late work criterion and convex resource consumption functions
• Single-machine scheduling with controllable processing times: a complexity dichotomy and a faster algorithm

This page was built for publication: Two-machine flow shop scheduling with convex resource consumption functions

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