A resource allocation problem with convex resource-dependent processing times under a two-machine flow shop environment

Cites Work

Unnamed Item
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
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
A tabu-search 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
Convex resource allocation for minimizing the makespan in a single machine with job release dates
Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
Minimizing the total weighted flow time in a single machine with controllable processing times
A survey of scheduling with controllable processing times
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
Resource Management in Machine Scheduling Problems: A Survey
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
The open shop scheduling problem with a given sequence of jobs on one machine
Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions
Multiple-project scheduling with controllable project duration and hard resource constraint: Some solvable cases
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