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

DOI10.1016/S0377-2217(97)00343-3MaRDI QIDQ1296091zbMATH OpenWikidataFDO

Authors Adam Janiak

Publication date 11 July 1999

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

Full work available at URL https://doi.org/10.1016/S0377-2217(97)00343-3

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)

Recommendations

• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Two-machine flow shop scheduling with convex resource consumption functions
• A two-machine flow shop scheduling problem with controllable job processing times
• scientific article; zbMATH DE number 4074798
• Scheduling unit-time tasks in renewable resource constrained flowshops

Cites work

• A Comparative Study of Flow-Shop Algorithms
• A bicriterion approach to time/cost trade-offs in sequencing
• Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
• Job-shop scheduling with resource-time models of operations
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
• Optimal two- and three-stage production schedules with set-up time included
• 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
• Time-optimal control in a single machine problem with resource constraints

Cited in

(15)

• Scheduling with controllable release dates and processing times: Makespan minimization
• Scheduling with controllable release dates and processing times: total completion time minimization
• Parallel machine scheduling with a convex resource consumption function
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
• 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
• Minimizing makespan on a two-machine re-entrant flowshop
• Scheduling two agents with controllable processing times
• A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
• Pre-emptive scheduling problems with controllable processing times
• Just-in-time scheduling with controllable processing times on parallel machines
• Two-machine open shop problem with controllable processing times
• Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem

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

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