The car sequencing problem is to find feasible sequences of product variants requiring specific options while taking care of sequencing constraints. First, a branching scheme and constraint propagation algorithms for the computation of feasible sequences are provided. Second, an algorithm is...

Gegenstand der vorliegenden Arbeit sind zwei praktisch und theoretisch bedeutsame Probleme, die bei just-in-time orientierter Variantenfließfertigung auftreten. Ein Problem besteht darin, den Teilebedarf in der Endmontage so konstant wie möglich zu halten ("Level Scheduling Problem"). Das...

Purpose: The main goal is to understand the way many factors affect the investment decision making process and business performance.Design/methodology/approach: This study proposes a new conceptual framework for examining the reasons that manufacturing firms decide to invest on the acquisition...

Cargo conveyance onboard dry bulk carriers is contemporarily often affiliated to preoperational waiting times, which may affect the income situation of stakeholders and the sustainability of the sector. Therefore, repetitively occurring waiting problems, potentially paired with port congestion...

While developing Asia has used fragmentation and industrial agglomeration as leverage to create impetus for sustaining its competitiveness, the downside risks of just-in-time procurement and production have not been sufficiently emphasized. Based on the experience of Thailand's flooding in 2011,...

This paper provides an extensive overview of the economic importance and evolution of the car manufacturing industry. In addition, it provides evidence that the car industry is still playing a vital role in process innovation. The currently widespread lean production method, under which...

One of the basic assumptions of the classical dynamic lot-sizing model is that theaggregate demand of a given period must be satisfied in that period. Under thisassumption, if backlogging is not allowed then the demand of a given period cannotbe delivered earlier or later than the period. If...

The problem of scheduling multiple, large scale, make-to-order assemblies is considered. Beside "classical" precedence- and resource constraints as known from resource constrained project scheduling we take spatial resource and part availability constraints into account. The objective is to...

We consider the problem of scheduling multiple, large-scale, make-to-order assemblies under resource, assembly area, and part availability constraints. Such problems typically occur in the assembly of high volume, discrete make-to-order products. Based on a list scheduling procedure which has...