Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs

DOI10.1142/S0217595914500444zbMath1307.90078OpenAlexW1969597650MaRDI QIDQ5174414

Yunqiang Yin, Shuenn-Ren Cheng, Chin-Chia Wu

Publication date: 17 February 2015

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595914500444

zbMATH Keywords

parallel-machine schedulingbatch delivery costholding time

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25)

Related Items (1)

Scheduling and common due date assignment on a single parallel-batching machine with batch delivery

Cites Work

• Batch delivery scheduling with batch delivery cost on a single machine
• 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 common due window assignment and scheduling to minimize the total cost
• Scheduling with batching: A review
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Batch Delivery Scheduling on a Single Machine
• Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
• Scheduling Groups of Jobs on a Single Machine
• SCHEDULING WITH POSITION-BASED DETERIORATING JOBS AND MULTIPLE DETERIORATING RATE-MODIFYING ACTIVITIES

This page was built for publication: Parallel-Machine Scheduling to Minimize Flowtime, Holding, and Batch Delivery Costs