SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK

DOI10.1142/S0217595912500480zbMath1262.90069OpenAlexW2072208921MaRDI QIDQ4921478

Zhaohui Liu, Leiyang Wang

Publication date: 10 May 2013

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

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

zbMATH Keywords

schedulingapproximation algorithmbatch deliverystar-shaped network

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Tighter bounds of the First Fit algorithm for the bin-packing problem
• Machine scheduling with deliveries to multiple customer locations
• The coordination of scheduling and batch deliveries
• On the machine scheduling problem with job delivery coordination
• Approximation algorithm for minimizing total latency in machine scheduling with deliveries
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• Single machine scheduling with batch deliveries
• Machine scheduling with job delivery coordination
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Optimal two- and three-stage production schedules with setup times included
• The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan
• Integrated Scheduling of Production and Distribution Operations
• Batching and Scheduling Jobs on Batch and Discrete Processors
• Single Machine Scheduling to Minimize Batch Delivery and Job Earliness Penalties
• Machine scheduling with transportation considerations
• Scheduling batches with simultaneous job processing for two-machine shop problems

This page was built for publication: SINGLE MACHINE SCHEDULING WITH BATCH DELIVERY TO MULTIPLE CUSTOMERS IN A STAR-SHAPED NETWORK