2015
DOI: 10.1016/j.ejor.2015.02.008
|View full text |Cite
|
Sign up to set email alerts
|

On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: Minimizing the makespan and delivery cost

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
12
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 51 publications
(12 citation statements)
references
References 22 publications
0
12
0
Order By: Relevance
“…Equation (12) calculates the completion time of each batch. Constraint (13) shows that each batch is assigned to a position and Relation (14) shows that each position has only one batch. Eq.…”
Section: Mixed Integer Non-linear Programmingmentioning
confidence: 99%
See 1 more Smart Citation
“…Equation (12) calculates the completion time of each batch. Constraint (13) shows that each batch is assigned to a position and Relation (14) shows that each position has only one batch. Eq.…”
Section: Mixed Integer Non-linear Programmingmentioning
confidence: 99%
“…Rostamzadeh et al [32] compared the existing models of supply, production and distribution in supply chain and introduced a model that integrates the mentioned criteria in supply chain management and provided a new method for the calculation of the fitness function in the process of a genetic algorithm [32]. Han et al [13] introduced minimization of both makespan and delivery costs in on-line supply chain scheduling for single-machine and parallel-machine configurations in a transportation system with a single customer [13,45]. Karimi and Davoudpour [17] addressed the scheduling for a supply chain with interrelated factories containing suppliers and manufacturers.…”
Section: Introductionmentioning
confidence: 99%
“…For the above three papers, the vehicle number and vehicle capacity were unlimited, and the delivery method is idd. For the online IPDP to minimize D max + TC, Han et al [11] investigated different IPDPs with parallel machine in terms of the number of vehicles and the capacity of vehicles. e competitive ratios were different in different IPDPs.…”
Section: Literature Reviewmentioning
confidence: 99%
“…e meanings of several terms about time in Figure 1 are described as follows: Han et al [11] Direct One Unlimited Direct D max + TC max (…”
Section: Problem Descriptionmentioning
confidence: 99%
“…Most of previous studies on CPTO problems focused on simple realistic characteristics, such as single transportation mode [8], the same order size [7,12], the same order processing complexity [5,13] and flow production [14]. However, previous studies seldom considered such more complicated realistic features as fixed vehicle departure times, multiple transportation modes and green transportations.…”
Section: Introductionmentioning
confidence: 99%