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.

Integrated Production and Outbound Distribution Scheduling: Review and Extensions

The third comprehensive survey on scheduling problems with setup times/costs

In most manufacturing and distribution systems, semi-finished jobs are transferred from one processing facility to another by transporters such as automated guided vehicles (AGVs) and conveyors, and finished jobs are delivered to customers or warehouses by vehicles such as trucks. Most machine scheduling models assume either that there are an infinite number of transporters for delivering jobs or that jobs are delivered instantaneously from one location to another without transportation time involved. In this paper, we study machine scheduling problems with explicit transportation considerations. Models are considered for two types of transportation situations. The first situation involves transporting a semi-finished job from one machine to another for further processing. The second appears in the environment of delivering a finished job to the customer or warehouse. Both transportation capacity and transportation times are explicitly taken into account in our models. We study this class of scheduling problems by analysing their complexity. We show that many problems are computationally difficult and propose polynomial or pseudo-polynomial algorithms for some problems. Copyright © 2001 John Wiley & Sons, Ltd.

/pdf/machine-scheduling-with-transportation-considerations-3w7ld5tmke.pdf

Machine scheduling with transportation considerations

Smart City and IoT

https://engagedscholarship.csuohio.edu/cgi/viewcontent.cgi?article=1053&context=bus_facpub

Order acceptance and scheduling: A taxonomy and review

Single machine scheduling with release dates and rejection

The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan

Single-machine scheduling under the job rejection constraint

https://ira.lib.polyu.edu.hk/bitstream/10397/1306/1/p-batch_with_C%26OR.pdf

Jinjiang Yuan

Papers

Single machine scheduling with release dates and rejection

The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan

Single-machine scheduling under the job rejection constraint

Bounded single-machine parallel-batch scheduling with release dates and rejection