Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval

DOI10.1016/j.ins.2014.02.142zbMath1341.90059OpenAlexW1967309777MaRDI QIDQ726392

Deshi Ye, Yunqiang Yin, Guo-Chuan Zhang

Publication date: 8 July 2016

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.02.142

zbMATH Keywords

schedulingbatch deliveryfully polynomial-time approximation scheme

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (11)

Single machine lot scheduling to minimize the total weighted (discounted) completion time ⋮ A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint ⋮ Single-machine batch scheduling problem with job rejection and resource dependent processing times ⋮ A knowledge-based approach for multi-factory production systems ⋮ Scheduling two parallel machines with machine-dependent availabilities ⋮ Scheduling jobs with maintenance subject to load-dependent duration on a single machine ⋮ Single-machine scheduling with workload-dependent maintenance duration to minimize maximum lateness ⋮ Minimizing maximum tardiness on a single machine with family setup times and machine disruption ⋮ Scheduling and common due date assignment on a single parallel-batching machine with batch delivery ⋮ Integrated production and delivery scheduling on a serial batch machine to minimize the makespan ⋮ Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval

Cites Work

• Unnamed Item
• Single machine batch scheduling with release times and delivery costs
• Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
• Batch sizing and job sequencing on a single machine
• Single machine flow-time scheduling with scheduled maintenance
• Single machine batch scheduling to minimize total completion time and resource consumption costs
• Batch delivery scheduling with batch delivery cost on a single machine
• Scheduling deteriorating jobs subject to job or machine availability constraints
• Minimizing the makespan in a single machine scheduling problems with flexible and periodic maintenance
• Single machine flow-time scheduling with a single breakdown
• Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs
• A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
• Single machine scheduling with batch deliveries
• On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date
• Single-machine scheduling with periodic maintenance and nonresumable jobs.
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Improving the complexities of approximation algorithms for optimization problems
• Scheduling with batching: A review
• A single-machine scheduling problem with maintenance activities to minimize makespan
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
• Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
• Supply Chain Scheduling: Batching and Delivery
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Algorithms for Scheduling Independent Tasks
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Batch Delivery Scheduling on a Single Machine
• Scheduling Groups of Jobs on a Single Machine

This page was built for publication: Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval