Capacitated two-parallel machines scheduling to minimize sum of job completion times

DOI10.1016/0166-218X(90)90055-HMaRDI QIDQ1208482zbMATH OpenFDO

Authors Chung-Yee Lee, Surya Danusaputro Liman

Publication date 16 May 1993

Published in Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

heuristicNP-complete\(n\)-job two-parallel machines schedulingpseudo-polynomial dynamic programming algorithmworst case error bound

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

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

Cites work

• scientific article; zbMATH DE number 3744543 (Why is no real title available?)
• scientific article; zbMATH DE number 3748968 (Why is no real title available?)
• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2146482 (Why is no real title available?)
• A Review of Production Scheduling
• 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
• 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
• Minimizing weighted number of tardy jobs and weighted earliness-tardiness penalties about a common due date
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Single-machine scheduling to minimize absolute deviation of completion times from a common due date

Cited in

(35)

• Minimizing the sum of job completion times on capacitated parallel machines
• Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem
• Rescheduling of identical parallel machines under machine eligibility constraints.
• Single-machine scheduling with maintenance and repair rate-modifying activities
• Two parallel machines scheduling with one availability constraint and jobs with delivery times
• scientific article; zbMATH DE number 2221458 (Why is no real title available?)
• Minimising total flow-time on two parallel machines with planned downtimes and resumable jobs
• Joint production and preventive maintenance scheduling for a single degraded machine by considering machine failures
• A new tabu search procedure for an audit-scheduling problem
• Minimizing the sum of job completion times on capacitated two-parallel machines
• Two-machine flowshop scheduling with availability constraints
• Parallel machine makespan minimization subject to machine availability and total completion time constraints
• Online and semi-online scheduling on capacitated two-parallel machines
• Single machine scheduling with linear deteriorating jobs under predictive disruption
• Makespan minimization for two parallel machines with an availability constraint
• Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
• Scheduling with limited machine availability
• Match-up scheduling under a machine breakdown
• 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
• Multitasking scheduling with shared processing
• Machine scheduling with an availability constraint
• Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
• Parallel machines scheduling with deteriorating jobs and availability constraints
• Single-machine scheduling with periodic maintenance and nonresumable jobs.
• A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint
• Parallel machines scheduling with machine maintenance for minsum criteria
• Min-Max partitioning problem with matroid constraint
• Total completion time minimization in a computer system with a server and two parallel processors
• scientific article; zbMATH DE number 1389747 (Why is no real title available?)
• Machine scheduling with a rate-modifying activity
• 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
• 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

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)