Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem

DOI10.1016/0020-0190(89)90009-4zbMath0685.90054OpenAlexW2062163671MaRDI QIDQ1262204

Adam Janiak

Publication date: 1989

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(89)90009-4

zbMATH Keywords

resource allocationheuristic algorithmsdeadlinetotal resource consumptiontwo-processor flow-shop problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Job-shop scheduling with convex models of operations ⋮ Single-machine scheduling with resource-dependent processing times and multiple unavailability periods ⋮ A survey of scheduling with controllable processing times ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A variant of the permutation flow shop model with variable processing times ⋮ Two-machine flow shop scheduling with convex resource consumption functions ⋮ A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates ⋮ Total completion time in a two-machine flowshop with deteriorating tasks ⋮ Two-machine open shop problem with controllable processing times ⋮ Parallel machine scheduling with a convex resource consumption function ⋮ Scheduling two agents with controllable processing times ⋮ Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling ⋮ Minimization of the makespan in a two-machine problem under given resource constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Time-optimal control in a single machine problem with resource constraints
• A bicriterion approach to time/cost trade-offs in sequencing
• Optimal two- and three-stage production schedules with setup times included
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• The Complexity of Flowshop and Jobshop Scheduling

This page was built for publication: Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem