2003
DOI: 10.1109/tra.2002.805659
|View full text |Cite
|
Sign up to set email alerts
|

Partner selection and synchronized planning in dynamic manufacturing networks

Abstract: In this paper, we develop a mixed-integer programming model for integrated partner selection and scheduling in an Internet-enabled dynamic manufacturing network environment. We assume that all stakeholders in the supply chain (SC) share information on their capacities, schedules, and cost structures. Based on this information, the model addresses the issue of partner selection and SC synchronization for profit maximization, while considering various manufacturing and logistics constraints. Furthermore, we stud… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
21
0
3

Year Published

2005
2005
2020
2020

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 78 publications
(24 citation statements)
references
References 18 publications
0
21
0
3
Order By: Relevance
“…The comparison of various prediction methods was such as shown in table Ⅰ. [10] There were much such phenomena in the reality world: A particular system was in the condition that it had been known, it was only related to now that the condition of the future moment of the system was, but it had not direct relationship to the past history. This was math model which can describe the kind of stochastic phenomena called Markov model.…”
Section: A Market Demand Forecast Methodsmentioning
confidence: 99%
“…The comparison of various prediction methods was such as shown in table Ⅰ. [10] There were much such phenomena in the reality world: A particular system was in the condition that it had been known, it was only related to now that the condition of the future moment of the system was, but it had not direct relationship to the past history. This was math model which can describe the kind of stochastic phenomena called Markov model.…”
Section: A Market Demand Forecast Methodsmentioning
confidence: 99%
“…Transportation costs are not calculated for individual products but for families of similar products, thus reducing the model complexity. Syam (2002) and Viswanadham and Gaonkar (2003) include a fixed charge per unit using a particular link to transfer products between units. Arntzen et al (1995), Dogan and Goetschalckx (1999), and Viswanadham and Gaonkar (2003) also include the transportation time parameter.…”
Section: Transportationmentioning
confidence: 99%
“…Accordingly, different models have to be defined at each level of the decision hierarchy to describe the multiple aspects of the SC. While the development of formal models for SC design at strategic and tactical levels was addressed in the related literature Dotoli et al, 2006;Gaonkar & Viswanadham, 2001;Luo et al, 2001;Vidal & Goetschalckx, 1997;Viswanadham & Gaonkar, 2003), research efforts are lagging behind in the subject of modeling and analyzing the SC operational performance. At the operational level, SCs can be viewed as Discrete Event Dynamical Systems (DEDSs), whose dynamics depends on the interaction of discrete events, such as customer demands, departure of parts or products from entities, arrival of transporters at facilities, start of assembly operations at manufacturers, arrival of finished goods at customers etc (Viswanadham & Raghavan, 2000).…”
Section: Introductionmentioning
confidence: 99%
“…While the SC optimization models presented in the related literature determine the decision parameters off-line (e.g. see Gaonkar & Viswanadham, 2001;Vidal & Goetschalckx, 1997;Viswanadham, 1999;Viswanadham & Gaonkar, 2003) in order to design and manage the SC, the task of the considered model is selecting some operational SC parameters in a short time, based on knowledge of the system state and of the occasional uncontrollable events. More precisely, the optimal mode of operation is obtained by the computation of control variables, i.e., the instantaneous firing speeds of continuous transitions, solving a linear programming problem optimizing a chosen performance index.…”
Section: Introductionmentioning
confidence: 99%