Minimization of the makespan in a two-machine problem under given resource constraints
From MaRDI portal
Publication:1296091
DOI10.1016/S0377-2217(97)00343-3zbMATH Open0943.90031WikidataQ127975565 ScholiaQ127975565MaRDI QIDQ1296091FDOQ1296091
Publication date: 11 July 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
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
- Scheduling unit-time tasks in renewable resource constrained flowshops
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- A bicriterion approach to time/cost trade-offs in sequencing
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
- Job-shop scheduling with resource-time models of operations
- A Comparative Study of Flow-Shop Algorithms
- Time-optimal control in a single machine problem with resource constraints
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
Cited In (14)
- 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
- 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)
