An integrated simulation–optimization study for consolidating production lines in a configure-to-order production environment
This study investigates production lines consolidation in a configure-to-order production environment using simulation and optimization strategies. The current production environment has three separate production lines that will be consolidated into two production lines. Two production line configurations are analyzed: product and process layouts. Product layout has a continuous smooth flow, small work-in-process (WIP), short total production time per unit of product, and reduced material handling requirements. On the contrary, process layout offers more flexibility, allows for higher utilization of machines, and requires higher grades of operators’ skills. A simulation-based comparison of the current and future systems is conducted considering lead time, throughput, utilization, and WIP. A mixed integer programming model that optimizes the transportation cost and waiting time is then formulated based on the selected process layout. Simulation results provide recommendations to improve the system level performance measures and support management decisions. The current transportation schedule is ineffective, and hence a real-time dashboard based on the optimization model is suggested. The dashboard will improve communication and transportation between the two production lines.
The coordination of transportation and batching scheduling
We study a coordinated scheduling problem of production and transportation in which each job is transported to a single batching machine for further processing. There are m vehicles that transport jobs from the holding area to the batching machine. Each vehicle can transport only one job at a time. The batching machine can process a batch of jobs simultaneously where there is an upper limit on the batch size. Each batch to be processed occurs a processing cost. The problem is to find a joint schedule of production and transportation such that the sum of the total completion time and the total processing cost is optimized. For a special case of the problem where the job assignment to the vehicles is predetermined, we provide a polynomial time algorithm. For the general problem, we prove that it is NP-hard (in the ordinary sense) and present a pseudo-polynomial time algorithm. A fully polynomial time approximation scheme for the general problem is obtained by converting an especially designed pseudo-polynomial dynamic programming algorithm.
Theorising heterosexuality : telling it straight
Heterosexuality and social theory heterosexuality and feminist theory heterosexuality and domestic life heterosexuality and social policy heterosexuality and the desire for gender recognition and heterosexual desire heterosexuality and masculinity - theorizing male power or the male wounded psyche? which one's the man? - the heterosexualization of lesbian sex in the same boat? - the gendered (in)exeperience of first hetero-sex collusion, collaboration and confession - on moving beyond the heterosexuality debate.