A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment
From MaRDI portal
(Redirected from Publication:6635995)
Recommendations
- Two-machine flow shop scheduling with convex resource consumption functions
- Minimization of resource consumption under a given deadline in the two- processor flow-shop scheduling problem
- Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time
- Minimization of the makespan in a two-machine problem under given resource constraints
- The Discrete Resource Allocation Problem in Flow Lines
Cites work
- scientific article; zbMATH DE number 3863589 (Why is no real title available?)
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
- A permutation flow-shop scheduling problem with convex models of operation processing times
- A survey of scheduling with controllable processing times
- A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
- Convex resource allocation for minimizing the makespan in a single machine with job release dates
- Faster algorithms for the shortest path problem
- Minimizing the total weighted flow time in a single machine with controllable processing times
- Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
- Parallel machine scheduling with a convex resource consumption function
- Resource management in machine scheduling problems: a survey
- Scheduling for fabrication and assembly in a two-machine flowshop with a fixed job sequence
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
- 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
- Two-machine flow shop scheduling with convex resource consumption functions
Cited in
(1)
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)
