A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
From MaRDI portal
Publication:6635995
DOI10.1142/S0217595923500185MaRDI QIDQ6635995FDOQ6635995
Authors: Byung-Cheon Choi, Jun Ho Lee
Publication date: 12 November 2024
Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- A survey of scheduling with controllable processing times
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- The open shop scheduling problem with a given sequence of jobs on one machine
- Total completion time minimization in two-machine flow shop scheduling problems with a fixed job sequence
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
- Faster algorithms for the shortest path problem
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Minimizing the total weighted flow time in a single machine with controllable processing times
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- Parallel machine scheduling with a convex resource consumption function
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- Resource management in machine scheduling problems: a survey
- A permutation flow-shop scheduling problem with convex models of operation processing times
- Two-machine flow shop scheduling with convex resource consumption functions
This page was built for publication: A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635995)