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

Engineering Commons

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

National Taiwan Ocean University

Scheduling

Articles 1 - 2 of 2

Full-Text Articles in Engineering

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.


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.