Two parallel machine sequencing problems involving controllable job processing times
From MaRDI portal
The authors consider a problem of scheduling \(n\) single-operation jobs on \(m\) non-identical machines. It is assumed that processing time of a job \(j\) by a machine \(i\) is controllable. The cost of performing a job is a linear function of its processing time. The scheduling cost to be minimized is: (A) the total processing cost plus total flow time, (B) the total processing cost plus total weighted earliness and weighted tardiness. For a single machine case \((m=1)\) the problem (A) was considered by \textit{R. G. Vickson} [AIIE Trans. 12, 258-262 (1980)], and the problem (B) was considered by \textit{S. S. Panwalkar} and \textit{R. Rajagopalan} [Eur. J. Oper. Res. 59, No. 2, 298-302 (1992; Zbl 0760.90058)]. The aim of the paper is to extend these results to multiple machines. Each problem is reduced to a transportation problem that can be solved by a polynomial time algorithm.
Recommendations
Cites work
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A survey of results for sequencing problems with controllable processing times
- A two-machine flow shop scheduling problem with controllable job processing times
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- Scheduling independent tasks to reduce mean finishing time
- Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis
- Single Stage Minimum Absolute Lateness Problem with a Common Due Date on Non-Identical Machines
- Single-machine sequencing with controllable processing times
- Solution structures and sensitivity of special assignment problems
- Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy
- The Factored Transportation Problem
Cited in
(44)- Single-machine scheduling with learning considerations
- Single-machine sequencing with controllable processing times
- Single machine scheduling with discretely controllable processing times
- Parallel machine scheduling with earliness--tardiness penalties and additional resource con\-straints.
- Some comments on sequencing with controllable processing times
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Minimizing completion time variance with compressible processing times
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- Scheduling a batching machine with convex resource consumption functions
- Scheduling two projects with controllable processing times in a single-machine environment
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling
- A unified view of parallel machine scheduling with interdependent processing rates
- A survey of scheduling with controllable processing times
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- Scheduling with due date assignment under special conditions on job processing
- Single machine scheduling with common due date and controllable processing times
- Multicriteria scheduling
- Unrelated parallel machine scheduling problem with special controllable processing times and setups
- Multicriteria scheduling problems: a survey
- A controlable two-machine flowshop scheduling problem
- Outsourcing decisions in m-machine permutation flow shop scheduling problems with machine-dependent processing times
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
- Scheduling with controllable processing times and compression costs using population-based heuristics
- Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times
- scientific article; zbMATH DE number 4010197 (Why is no real title available?)
- A survey on offline scheduling with rejection
- scientific article; zbMATH DE number 1271637 (Why is no real title available?)
- Single–machine scheduling with random machine breakdowns and randomly compressible processing times
- An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
- A makespan minimization problem for versatile developers in the game industry
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
- Single machine scheduling with resource dependent release times and processing times
- A mixed integer programming model and dynamic programming-based approach for multi-product production scheduling under deterioration effect
- Sequencing games with controllable processing times
- Single machine scheduling problems with controllable processing times and total absolute differences penalties
- Scheduling parallel CNC machines with time/cost trade-off considerations
- A survey of results for sequencing problems with controllable processing times
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- Just-in-time scheduling with controllable processing times on parallel machines
- A unified approach for scheduling with convex resource consumption functions using positional penalties
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times
- Optimal control of production processes with variable execution times
- Optimal due date assignment and resource allocation in a group technology scheduling environment
This page was built for publication: Two parallel machine sequencing problems involving controllable job processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1310019)
