 We address the two-stage multi-machine assembly scheduling problem to minimize total completion times of all jobs. The first stage consists of m independently working machines where each machine produces its own component. The second stage consists of two independent and identical assembly machines. The processing of a job at the second stage cannot start until its m components, produced by t...

The paper considers the problem of preemptive scheduling in a two-stage flowshop with parallel unrelated machines at the first stage and a single machine at the second stage. At the first stage, jobs use some additional renewable resources which are available in limited quantities. The resource requirements are of 0-1 type. The objective is minimization of the makespan. The problem is NP-hard. ...

the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

⎯There have been many studies on two-stage supply models. Because supply chains are increasingly more complicated, this study considers the three-stage supply chain configurations which involve multiple companies at each stage and each company at the upstream stages can supply two or more customers. The coordination mechanisms for the members along the chain are achieved in the following two as...

In this paper we address a scheduling problem taken from a label sticker manufacturing company. The production system is a two-stage hybrid flow shop with the characteristics of sequence-dependent setup time at stage 1, dedicated machines at stage 2, and two due dates. The objective is to schedule one day’s mix of label stickers through the shop such that the weighted maximal tardiness is minim...

This paper discusses the application of neural networks to select the best heuristic algorithm to solve a given scheduling problem. The two-stage hybrid owshop with multiple identical parallel machines at the second stage is used as an example to discuss the process of selecting a scheduling heuristic through a neural-network approach. This paper uses the genetic-algorithm-based approach for tr...