Minimization of the makespan in a two-machine problem under given resource constraints

DOI10.1016/S0377-2217(97)00343-3zbMath0943.90031WikidataQ127975565 ScholiaQ127975565MaRDI QIDQ1296091

Adam Janiak

Publication date: 11 July 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

linear modeltwo-machine flow-shoptransferable resource

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Related Items (12)

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 ⋮ Pre-emptive scheduling problems with controllable processing times ⋮ Scheduling with controllable release dates and processing times: Makespan minimization ⋮ Scheduling with controllable release dates and processing times: total completion time minimization ⋮ A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates ⋮ Two-machine open shop problem with controllable processing times ⋮ Bicriterion scheduling with a negotiable common due window and resource-dependent processing times ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ 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

Cites Work

• Time-optimal control in a single machine problem with resource constraints
• A bicriterion approach to time/cost trade-offs in sequencing
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Job-shop scheduling with resource-time models of operations
• 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
• A Comparative Study of Flow-Shop Algorithms
• Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
• Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy

This page was built for publication: Minimization of the makespan in a two-machine problem under given resource constraints