Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network

Open Access. Powered by Scholars. Published by Universities.®

PDF

National Taiwan Ocean University

Scheduling

Articles 1 - 4 of 4

Full-Text Articles in Entire DC Network

An Exact And Meta-Heuristic Approach For Two-Agent Single-Machine Scheduling Problem, Wen-Hung Wu Apr 2013

An Exact And Meta-Heuristic Approach For Two-Agent Single-Machine Scheduling Problem, Wen-Hung Wu

Journal of Marine Science and Technology

In many real-life applications, it can be often found that multiple agents compete on the usage of a common processing resource in different application environments and different methodological fields, such as artificial intelligence, decision theory, operations research, etc. Moreover, scheduling with multiple agents is relatively unexplored. Based on this observation, this paper attempts to study a single-machine scheduling problem where the objective is to minimize the total tardiness of the first agent with the constraint that no tardy job is allowed for the second agent. In this study, we provide a branch-and-bound algorithm and a genetic algorithm for the optimal …


Due-Date Assignment And Optional Maintenance Activity Scheduling Problem With Linear Deterioreting Jobs, Chou-Jung Hsu, Suh-Jenq Yang, Dar-Li Yang Feb 2011

Due-Date Assignment And Optional Maintenance Activity Scheduling Problem With Linear Deterioreting Jobs, Chou-Jung Hsu, Suh-Jenq Yang, Dar-Li Yang

Journal of Marine Science and Technology

The focus of this work is to analyze linear deteriorating jobs in a single-machine scheduling problem with due-date assignment and maintenance activity. The linear deteriorating jobs means its processing time is an increasing function of their starting time. The objective is to minimize the total of earliness, tardiness and due-date cost. To solve the scheduling problem addressed in this work, we have to determine the job sequence, the common due-date, and the location of a maintenance activity. We show that the problem can be solved optimally in O(n2 log n) time.


Optimal Scheduling Models For Ferry Companies Under Alliances, Shangyao Yan, Chia-Hung Chen, Hsin-Yen Chen, Tze-Chiang Lou Feb 2007

Optimal Scheduling Models For Ferry Companies Under Alliances, Shangyao Yan, Chia-Hung Chen, Hsin-Yen Chen, Tze-Chiang Lou

Journal of Marine Science and Technology

Ferry companies in Taiwan increasingly ally themselves with other ferry companies as a means of forming more complete networks, to operate more efficiently. The more complex ferry fleet routing and scheduling processes are not only important in each company’s operations, but also have a bearing on the alliance. In this research, we employ network flow techniques to construct several coordinated scheduling models to help solve for the most satisfactory schedules for the allied ferry companies. Finally, we perform a case study based on real operating data from two Taiwan ferry companies to evaluate the models. The preliminary results show that …


Minimizing The Makespan In A Two-Stage Flowshop Scheduling Problem With A Function Constraint On Alternative Machines, Chou-Jung Hsu, Wen-Hung Kuo, Dar-Li Yang, Maw-Sheng Chern Sep 2006

Minimizing The Makespan In A Two-Stage Flowshop Scheduling Problem With A Function Constraint On Alternative Machines, Chou-Jung Hsu, Wen-Hung Kuo, Dar-Li Yang, Maw-Sheng Chern

Journal of Marine Science and Technology

In this paper, we consider a two-stage flowshop scheduling problem with a function constraint on alternative machines. The objective is to minimize the makespan. We show that the proposed problem is NP-hard and provide some heuristic algorithms and computational experiments. In addition, from the experimental results, the modification of Johnson’s rule combined with the First-Fit rule is the best heuristic algorithm of the proposed heuristic algorithms.