Unbounded parallel-batch scheduling with family jobs and delivery coordination
type: Item
instance of: scholarly article
title: Unbounded parallel-batch scheduling with family jobs and delivery coordination
zbMATH Open document ID: 1260.68039
author: Jinjiang Yuan
author: Baoqiang Fan
author: Shisheng Li
published in: Information Processing Letters
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6149229
zbMATH Keywords: parallel-batch scheduling
zbMATH Keywords: family jobs
zbMATH Keywords: batch delivery
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.03.014
OpenAlex ID: W2082532447
cites work: Supply chain scheduling: sequence coordination
cites work: Scheduling a batching machine
cites work: Complexity results for single-machine problems with positive finish-start time-lags
cites work: Machine scheduling with job delivery coordination
cites work: Logistics scheduling with batching and transportation
cites work: Approximation algorithms for two-machine flow shop scheduling with batch setup times
cites work: Integrated Production and Outbound Distribution Scheduling: Review and Extensions
cites work: Integrated Scheduling of Production and Distribution Operations
cites work: Q4198056
cites work: The integrated production and transportation scheduling problem for a product with a short lifespan
cites work: Open Shop Scheduling to Minimize Finish Time
cites work: Supply Chain Scheduling: Batching and Delivery
cites work: Efficient scheduling algorithms for a single batch processing machine
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Machine scheduling with transportation considerations
cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
cites work: Machine scheduling with deliveries to multiple customer locations
cites work: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
cites work: Unbounded parallel batch scheduling with job delivery to minimize makespan
cites work: The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan
cites work: Scheduling batches with simultaneous job processing for two-machine shop problems
cites work: Machine scheduling with an availability constraint and job delivery coordination
cites work: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
cites work: On the machine scheduling problem with job delivery coordination
DOI: 10.1016/J.IPL.2011.03.014
Recommended article: Unbounded parallel batch scheduling with job delivery to minimize makespan
Recommended article: Online Scheduling of Incompatible Family Jobs with Equal Length on an Unbounded Parallel-Batch Machine with Job Delivery
Recommended article: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
Recommended article: Online unbounded batch scheduling on parallel machines with delivery times
Recommended article: Scheduling with families of jobs and delivery coordination under job availability
Recommended article: Online scheduling on unbounded parallel-batch machines with incompatible job families
Recommended article: Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
Recommended article: Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
Recommended article: A note on unbounded parallel-batch scheduling
Recommended article: Unbounded parallel-batch scheduling with drop-line tasks
description: scientific article; zbMATH DE number 6149229