Journal ArticleDOI
Single Supplier Scheduling for Multiple Deliveries
TLDR
The problem of scheduling the production and delivery of a supplier to feed the production of F manufacturers is studied and is proved to be NP-hard.Abstract:
The problem of scheduling the production and delivery of a supplier to feed the production of F manufacturers is studied The orders fulfilled by the supplier are delivered to the manufacturers in batches of the same size The supplier's production line has to be set up whenever it switches from processing an order of one manufacturer to an order of another manufacturer The objective is to minimize the total setup cost, subject to maintaining continuous production for all manufacturers The problem is proved to be NP-hard It is reduced to a single machine scheduling problem with deadlines and jobs belonging to F part types An O(Nlog F) algorithm, where N is the number of delivery batches, is presented to find a feasible schedule A dynamic programming algorithm with O(N
F
/F
F−2) running time is presented to find an optimal schedule If F=2 and setup costs are unit, an O(N) time algorithm is derivedread more
Citations
More filters
Journal ArticleDOI
A logistics scheduling model: scheduling and transshipment for two processing centers
TL;DR: A logistics scheduling model for two processing centers that are located in different cities and can be modeled as a parallel-machine scheduling problem with transshipment between the machines.
Journal ArticleDOI
Supply chain scheduling and coordination with dual delivery modes and inventory storage cost
TL;DR: It is proved that the two-echelon supply chain scheduling problem in which a manufacturer acquires supplies from an upstream supplier and processes orders from the downstream retailers is NP-hard in the ordinary sense only.
Journal ArticleDOI
Coordinated Logistics Scheduling for In-House Production and Outsourcing
TL;DR: This research considers a particular problem for a firm that has an option of using a subcontractor to fulfill part of its orders, and builds models and provides optimal solutions for the specific cases discussed in this paper.
Journal ArticleDOI
Outsourcing and production scheduling for a two-stage flow shop
TL;DR: This paper presents models for different situations of outsourcing and develops optimization algorithms for each, and conducts computational experiments to study the managerial insights for the models and the algorithms.
Journal ArticleDOI
Multi-objective analysis of an integrated supply chain scheduling problem
TL;DR: In this paper, the problem of minimizing the total weighted tardiness and total distribution costs in an integrated production and distribution environment is studied, where orders are received by a manufacturer, processed on a single production line, and delivered to customers by capacitated vehicles.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Coordinated supply chain management
TL;DR: In this paper, the authors review the literature addressing coordinated planning between two or more stages of the supply chain, placing particular emphasis on models that would lend themselves to a total supply chain model.
Journal ArticleDOI
Scheduling with batching: A review
TL;DR: This paper reviews the literature on scheduling with batching, giving details of the basic algorithms, and referencing other significant results about efficient dynamic programming algorithms for solving batching problems.