Scheduling Computer and Manufacturing Processes

Błażewicz, Jacek; Ecker, Klaus; Pesch, Erwin; Schmidt, Günter; Węglarz, Jan

doi:10.1007/978-3-662-04363-9

Cited by 175 publications

(85 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This rule schedules the longest jobs first so that no one large job will 'stick out' at the end of the schedule and dramatically lengthen the completion time of the last job. The time complexity of LPT is known to be Oðn log nÞ (Blazewicz et al, 2001). In order to describe the LPT approach, we use the following example with no allocation.…”

Section: Heuristic Solution Methodologymentioning

confidence: 99%

See 1 more Smart Citation

Multiple part-type scheduling in flexible robotic cells

Batur

Karaşan

Aktürk

2012

International Journal of Production Economics

View full text Add to dashboard Cite

a b s t r a c tThis paper considers the scheduling problem arising in two-machine manufacturing cells which repeatedly produce a set of multiple part-types, and where transportation of the parts between the machines is performed by a robot. The cycle time of the cell depends on the robot move sequence as well as the processing times of the parts on the machines. For highly flexible CNC machines, the processing times can be adjusted. To this end, this study tries to find the robot move sequence as well as the processing times of the parts on each machine that jointly minimize the cycle time. The problem of determining the best cycle in a 2-machine cell is first modeled as a traveling salesman problem. Then, an efficient 2-stage heuristic algorithm is constructed and compared with the most common heuristic approach of longest processing time (LPT).

show abstract

Section: Heuristic Solution Methodologymentioning

confidence: 99%

“…In parallel machine systems, LPT approach is commonly used (Blazewicz et al, 2001). This rule sorts the jobs in the order of decreasing processing times.…”

Section: Heuristic Solution Methodologymentioning

confidence: 99%

Multiple part-type scheduling in flexible robotic cells

Batur

Karaşan

Aktürk

2012

International Journal of Production Economics

View full text Add to dashboard Cite

show abstract

“…Equitable colorings naturally arise in some scheduling, partitioning, and load balancing problems [2,12,13]. In 1970 Hajnal and Szemerédi [3] proved the following theorem, which had been conjectured by Erdős.…”

Section: Introductionmentioning

confidence: 99%

A fast algorithm for equitable coloring

Kierstead

Kostochka

Mydlarz³

et al. 2010

Combinatorica

View full text Add to dashboard Cite

show abstract

“…Operations scheduling is a decision process that defines strategies from orders release down to detailed programming (Baker & Trietsch, 2009;Blazewicz et al, 2001;Pinedo, 2012). Therefore, for determining how an order will be executed it is necessary to decide when an order should be processed and which resource should be used for each task.…”

Section: Introductionmentioning

confidence: 99%

An ordered heuristic for the allocation of resources in unrelated parallel-machines

Santos¹,

Madureira²,

Varela³

2015

10.5267/j.ijiec

View full text Add to dashboard Cite

Global competition pressures have forced manufactures to adapt their productive capabilities. In order to satisfy the ever-changing market demands many organizations adopted flexible resources capable of executing several products with different performance criteria. The unrelated parallel-machines makespan minimization problem (Rm||Cmax) is known to be NPhard or too complex to be solved exactly. In the heuristics used for this problem, the MCT (Minimum Completion Time), which is the base for several others, allocates tasks in a random like order to the minimum completion time machine. This paper proposes an ordered approach to the MCT heuristic. MOMCT (Modified Ordered Minimum Completion Time) will order tasks in accordance to the MS index, which represents the mean difference of the completion time on each machine and the one on the minimum completion time machine. The computational study demonstrates the improved performance of MOMCT over the MCT heuristic.

show abstract

Scheduling Computer and Manufacturing Processes

Cited by 175 publications

References 0 publications

Multiple part-type scheduling in flexible robotic cells

Multiple part-type scheduling in flexible robotic cells

A fast algorithm for equitable coloring

An ordered heuristic for the allocation of resources in unrelated parallel-machines

Contact Info

Product

Resources

About