Capacitated two-parallel machines scheduling to minimize sum of job completion times
From MaRDI portal
Publication:1208482
DOI10.1016/0166-218X(90)90055-HzbMATH Open0778.90028MaRDI QIDQ1208482FDOQ1208482
Authors: Chung-Yee Lee, Surya Danusaputro Liman 
Publication date: 16 May 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Minimizing the sum of job completion times on capacitated parallel machines
- Minimizing the sum of job completion times on capacitated two-parallel machines
- Two parallel machines scheduling with one availability constraint and jobs with delivery times
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
- Online and semi-online scheduling on capacitated two-parallel machines
heuristicNP-complete\(n\)-job two-parallel machines schedulingpseudo-polynomial dynamic programming algorithmworst case error bound
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Title not available (Why is that?)
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- Minimizing mean absolute deviation of completion times about a common due date
- A Review of Production Scheduling
- Title not available (Why is that?)
- Minimizing the average deviation of job completion times about a common due date
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Title not available (Why is that?)
- Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
- Single-machine scheduling to minimize absolute deviation of completion times from a common due date
Cited In (35)
- Machine scheduling with an availability constraint
- Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
- A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
- Single machine scheduling with linear deteriorating jobs under predictive disruption
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Minimizing the sum of job completion times on capacitated two-parallel machines
- Total completion time minimization in a computer system with a server and two parallel processors
- Parallel machines scheduling with machine maintenance for minsum criteria
- Parallel machines scheduling with deteriorating jobs and availability constraints
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
- Identical parallel-machine scheduling under availability constraints to minimize the sum of completion times
- Rescheduling of identical parallel machines under machine eligibility constraints.
- Title not available (Why is that?)
- Online and semi-online scheduling on capacitated two-parallel machines
- Minimizing the sum of job completion times on capacitated parallel machines
- A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint
- Title not available (Why is that?)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
- Scheduling with limited machine availability
- A new tabu search procedure for an audit-scheduling problem
- Single-machine scheduling with periodic maintenance and nonresumable jobs.
- Min-Max partitioning problem with matroid constraint
- Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
- Two parallel machines scheduling with one availability constraint and jobs with delivery times
- Makespan minimization for two parallel machines with an availability constraint
- Single-machine scheduling with maintenance and repair rate-modifying activities
- Two-machine flowshop scheduling with availability constraints
- Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
- Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
- Machine scheduling with a rate-modifying activity
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
- Match-up scheduling under a machine breakdown
- Multitasking scheduling with shared processing
This page was built for publication: Capacitated two-parallel machines scheduling to minimize sum of job completion times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208482)
