Jackson's rule for single-machine scheduling: making a good heuristic better
Mathematics of Operations Research
Heuristics for parallel machine scheduling with delivery times
Acta Informatica
On the fixed interval due-date scheduling problem
Discrete Applied Mathematics
SIAM Journal on Discrete Mathematics
Makespan minimization for flow-shop problems with transportation times and a single robot
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling with job release dates, delivery times and preemption penalties
Information Processing Letters
Scheduling with Fixed Delivery Dates
Operations Research
Supply chain scheduling: Batching and delivery
Operations Research
Integrated Scheduling of Production and Distribution Operations
Management Science
Sequencing the processing of incoming mail to match an outbound truck delivery schedule
Computers and Operations Research
Improved algorithms for two single machine scheduling problems
Theoretical Computer Science - Algorithmic applications in management
Scheduling of single stage assembly with air transportation in a consumer electronic supply chain
Computers and Industrial Engineering - Special issue: Logistics and supply chain management
Order Assignment and Scheduling in a Supply Chain
Operations Research
Approximation schemes for constrained scheduling problems
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Manufacturing & Service Operations Management
The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan
INFORMS Journal on Computing
Production and delivery scheduling problem with time windows
Computers and Industrial Engineering - Special issue: Selected papers from the 30th international conference on computers; industrial engineering
Delivery volume improvement for planning medication distribution
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Capacity Allocation and Scheduling in Supply Chains
Operations Research
Unbounded parallel-batch scheduling with family jobs and delivery coordination
Information Processing Letters
Theoretical Computer Science
Integrated production and distribution scheduling with committed delivery dates
Operations Research Letters
Semi-online two-level supply chain scheduling problems
Journal of Scheduling
Batching and delivery in semi-online distribution systems
Discrete Applied Mathematics
Tabu search and lower bounds for a combined production-transportation problem
Computers and Operations Research
Multi-location production and delivery with job selection
Computers and Operations Research
Hi-index | 0.00 |
In many applications involving make-to-order or time-sensitive (e.g., perishable, seasonal) products, finished orders are often delivered to customers immediately or shortly after the production. Consequently, there is little or no finished product inventory in the supply chain such that production and outbound distribution are very intimately linked and must be scheduled jointly to achieve a desired on-time delivery performance at minimum total cost. Research on integrated scheduling models of production and outbound distribution is relatively recent but is growing very rapidly. In this paper, we provide a survey of such existing models. We present a unified model representation scheme, classify existing models into several different classes, and for each class of the models give an overview of the optimality properties, computational tractability, and solution algorithms for the various problems studied in the literature. We clarify the tractability of some open problems left in the literature and some new problems by providing intractability proofs or polynomial-time exact algorithms. We also identify several problem areas and issues for future research.