Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates

Liu, C. Y.; Bulfin, Robert L.

doi:10.1287/opre.36.4.553

Cited by 30 publications

(5 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Unit processing time problems are closely related to Latin squares and to Latin rectangles; various techniques such as those from edge coloring in bipartite graphs and from matching theory are useful. For example, Liu & Bulfin [357] show that problems Oh,Pij = IICmax , 0IPij = IILmax, 0IPij = 11 ETj and 0IPij = 11 E Uj are solvable in polynomial time. For more information and numerous references, we refer the reader to the survey of Kubiak, Sriskandarajah & Zaras [312], and to the articles of Gonzalez [211], Liu & Bulfin [357], and Brucker, Jurisch & Jurisch [66].…”

Section: 4)mentioning

confidence: 99%

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

Chen

Potts

Woeginger

1998

Handbook of Combinatorial Optimization

189

145

View full text Add to dashboard Cite

Section: 4)mentioning

confidence: 99%

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

Chen

Potts

Woeginger

1998

Handbook of Combinatorial Optimization

189

145

View full text Add to dashboard Cite

“…The OSSP is classified based on its objectives, which vary with the shop environment. Common objectives are minimizing the makespan (Roshanaei et al 2010); total tardiness (Błażewicz et al 2004); number of late jobs (Liu and Bulfin 1988); and maximal lateness (Naderi et al 2011). Another way to classify OSSP is based on the different solution methodologies: theoretical studies (Shakhlevich et al 2000); mathematical modeling (Kis et al 2010); exact algorithms (Brucker et al 1997); heuristics (Panneerselvam 1999); genetic algorithms (Doulabi et al 2012); tabu search algorithms (Seraj et al 2009); simulated annealing algorithms (Roshanaei et al 2010); ant colony optimization algorithms (Chernykh et al 2013); bee colony optimization algorithms (Huang and Lin 2011); and hybrid algorithms (Blum 2005).…”

Section: Open-shop Scheduling Problemmentioning

confidence: 99%

Practical approaches to chemical tanker scheduling in ports: a case study on the Port of Houston

2019

View full text Add to dashboard Cite

The objective of this study was to develop practical scheduling solutions for chemical tankers visiting the Port of Houston (PoH). Chemical tanker movements represent approximately 42% of the Houston Ship Channel traffic. Historically, chemical tanker scheduling has been problematic and has resulted in long waiting times for tankers. Scheduling is difficult because chemical tankers carry several liquid cargoes and must visit multiple terminals for loading and unloading. Physical constraints (layout of the port and draft) and commercial constrains (such as terminal and personnel readiness for cargo handling operations, tank cleaning processes, and inspection requirements) create a complex scheduling problem, long waiting times, and unnecessary tanker movements in the port. These problems cause an increase in the business costs for shipowners, risk of collisions and allisions, production of additional air emissions, and decreases in the operating capacity of terminals. The recent expansion decisions for chemical and petrochemical plants in Houston, Texas, will exacerbate the problem. Significant benefits could thus be gained even for small scheduling improvements. Currently, the scheduling practice of loading/unloading activities in the PoH involves primarily the manual and de-centralized use of the "first come, first served" (FCFS) rule, which results in inefficiencies such as long waiting times and poor resource utilization. We propose two mathematical methods to address the tanker scheduling problem in the port: a mixed-integer programming (MIP) method, and a constraint programming (CP) method. The two methods are formulated as open-shop scheduling problems with sequence-dependent post-setup times. MIP yields optimum results that minimize makespan. However, computation time increases significantly as the number of tankers, or the number of terminals, increases. CP achieves better makespan results in a shorter run time, compared to MIP, for medium to large-scale problems including the problem considered in this case study. Overall, the results show that MIP is more suitable for real-time scheduling tools (hourly and daily), whereas CP is the better option for longer-horizon scheduling problems (weekly or monthly). Our models gave good alternative schedules under short optimization run times. Hence, they can afford decision makers sufficient time to complete multiple optimization scenarios and implementation setups.

show abstract

“…Liu and Bulfin [88] considered the open shop problem with identical processing times for jobs, specifically unit processing times or unit execution times (UET). They provided two algorithms, viz., Algorithm 1 and Algorithm 2 to minimize total tardiness and the number of tardy jobs, respectively.…”

Section: Heuristicsmentioning

confidence: 99%

Literature Review of Open Shop Scheduling Problems

Anand¹,

Panneerselvam²

2015

IIM

View full text Add to dashboard Cite

This paper discusses review of literature of open shop scheduling problems. First, the problem is classified as per different measures of performance, viz., minimization of makespan, minimization of sum of completion times of jobs, minimization of sum of weighted completion times of all jobs, minimization of total tardiness of all jobs, minimization of sum of weighted tardiness of all jobs, minimization of weighted sum of tardy jobs, and miscellaneous measures of the open shop scheduling problem. In each category, the literature is further classified based on approaches used and then the contributions of researchers in the respective categories are presented. Directions for future research are discussed in the end.

show abstract

Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates

Cited by 30 publications

References 13 publications

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

A Review of Machine Scheduling: Complexity, Algorithms and Approximability

Practical approaches to chemical tanker scheduling in ports: a case study on the Port of Houston

Literature Review of Open Shop Scheduling Problems

Contact Info

Product

Resources

About