Multiprocessor Scheduling, Theory and Applications 2007
DOI: 10.5772/5226
|View full text |Cite
|
Sign up to set email alerts
|

A New Mathematical Model for Flexible Flow Lines with Blocking Processor and Sequence-Dependent Setup Time

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2009
2009
2009
2009

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 41 publications
0
2
0
Order By: Relevance
“…which is the materials that have had some work done to them but are not yet finished; f) Rework/scrap which represents the percentage of recycle or degrading as the products go through the manufacturing systems [34], g) Setup Time represents the time required to change a machine from making one product or service to making another. [35]. Simultaneous reduction setup times and lot sizes are the most effective way to reduce inventory levels and improve customerservice [36].…”
Section: Ps and Rs Controllersmentioning
confidence: 99%
“…which is the materials that have had some work done to them but are not yet finished; f) Rework/scrap which represents the percentage of recycle or degrading as the products go through the manufacturing systems [34], g) Setup Time represents the time required to change a machine from making one product or service to making another. [35]. Simultaneous reduction setup times and lot sizes are the most effective way to reduce inventory levels and improve customerservice [36].…”
Section: Ps and Rs Controllersmentioning
confidence: 99%
“…They also presented a new formulation for batch scheduling with various specific cutting constraints. Tavakkoli-Moghaddam and Safaei (2006) presented an intial idea to consider both the blocking processor and sequence dependent setup time in flexible flow lines. Kis and Pesch (2005) provided a comprehensive and uniform overview on exact solution methods for flexible flow shops with branching, bounding, and propagating of constraints, under the following two objective functions: minimizing both the makespan and mean flow time of a schedule.…”
Section: Literature Reviewmentioning
confidence: 99%