IIE Transactions articles from May 2003

IIE Transactions archives from May 2003

On assemble-to-order systems with flexible customers.
May 1, 2003... 1. Introduction Assemble-to-order is a manufacturing strategy where parts and sub-assemblies are produced-to-stock, while the final assembly of products is delayed until customer orders have been received. Customer orders may require the...

Total WIP and WIP mix for a CONWIP controlled job shop.(Work-In-Process, pull control work-in-progress)
May 1, 2003... 1. Introduction By specifying the number of production authorizations (kanbans) in circulation on a manufacturing shop floor, pull control policies establish an upper bound for the Work-In-Process (WIP) since a fixed number of parts is...

Optimal and heuristic algorithms for the multi-location dynamic transshipment problem with fixed transshipment costs.
May 1, 2003... 1. Introduction and literature review Centrally controlled multi-location systems are capable of increasing their profitability through coordination. In recent years, organizations have started using novel logistic strategies such as...

A time-window sliding procedure for driver-task assignment with random service times.
May 1, 2003... 1. Introduction This paper addresses the problem of assigning drivers to cover a set of tasks that represent short-haul in-land container movements. The research is motivated by the drayage problem in Hong Kong, a city that handled over 16...

Capacitated, finish-to-order production planning with customer ordering day assignments.
May 1, 2003... 1. Introduction Companies that offer a large product variety from a single facility to geographically dispersed, time-sensitive customers often hold large amounts of inventory. Such companies can benefit from a finish-to-order strategy...

Sequencing on two-stage hybrid flowshops with uniform machines to minimize makespan.
May 1, 2003... 1. Introduction We define the problem of concern to us as follows. Let J denote the set of jobs, /J/ = n, all ready for processing at the same time. Each job j [member of] J consists of two tasks which are identified as (j,1) and (j, 2)....

A problem space algorithm for single machine weighted tardiness problems.
May 1, 2003... 1. Introduction In this paper we develop a Problem Space Genetic Algorithm (PSGA) for the single machine total weighted tardiness problem, 1 //[SIGMA] [w.sub.j] [T.sub.j]. The results are quite encouraging relative to the best algorithm in...