oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Solving Flow-shop Sequencing Problem using Scheduling Algorithm based on Search and Prune Technique
Smita Verma,Megha Jain,Ranjana Singh
International Journal of Scientific Engineering and Technology , 2012,
Abstract: In sequencing problems, there are one or more jobs to be done and one or more machines are available for this purpose. If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow-shop problem. Flexible flow shops are thus generalization of simple flow shops. In this paper, we are solving flexible flow shop sequencing problem of two machine centers, using an algorithm. The proposed algorithm will be suitable for a medium-sized number of jobs; it is an optimal algorithm, entirely using the search-and-prune technique
Simulation of Sequencing Rules Using Witness in a Milling Job Shop  [cached]
Liqi Ang,Kuan Yew Wong,Wai Peng Wong
Communications of the IBIMA , 2011,
Abstract: Simulation is essential when studying manufacturing processes or designing production systems. This project was a real case study which involved a job shop with five similar CNC milling machines. A total of six jobs were performed and each of them consisted of a different set of operations. The sequence of the six jobs to enter the system was determined by the sequencing rules including shortest setup time (SST), shortest processing time (SPT), shortest processing and setup time (SPST), earliest due date (EDD), least process (LP), and lowest volume (LV). The setup time was taken into consideration to make the results more realistic. Due to the complexity of the model, WITNESS was used to simulate all the sequencing rules. The best approach was then determined by comparing the results of each rule. By doing this, the case company would be able to make a better decision on which job should be processed first instead of selecting it randomly among the jobs.
Variable Neighborhood Search for Parallel Machines Scheduling Problem with Step Deteriorating Jobs
Wenming Cheng,Peng Guo,Zeqiang Zhang,Ming Zeng,Jian Liang
Mathematical Problems in Engineering , 2012, DOI: 10.1155/2012/928312
Abstract: In many real scheduling environments, a job processed later needs longer time than the same job when it starts earlier. This phenomenon is known as scheduling with deteriorating jobs to many industrial applications. In this paper, we study a scheduling problem of minimizing the total completion time on identical parallel machines where the processing time of a job is a step function of its starting time and a deteriorating date that is individual to all jobs. Firstly, a mixed integer programming model is presented for the problem. And then, a modified weight-combination search algorithm and a variable neighborhood search are employed to yield optimal or near-optimal schedule. To evaluate the performance of the proposed algorithms, computational experiments are performed on randomly generated test instances. Finally, computational results show that the proposed approaches obtain near-optimal solutions in a reasonable computational time even for large-sized problems.
Scheduling Deteriorating Jobs with a Common Due Window on a Single Machine  [PDF]
Jintao Meng,Jun Yu,Xiaoxu Lu
Information Technology Journal , 2012,
Abstract: We consider the problem of scheduling deteriorating jobs and common due window location on a single machine. The actual processing time of a job is a linear increasing function of its starting time. The problem is to determine the optimal earliest due date, the due window size and the job schedule simultaneously to minimize costs for earliness, tardiness, earliest due date assignment and due window size penalties. A polynomial time optimal algorithm is presented to solve the problem.
Single machine slack due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity  [PDF]
Bo Cheng,Ling Cheng
Computer Science , 2014,
Abstract: In this paper, we consider the slack due-window assignment model and study a single machine scheduling problem of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. The cost for each job consists of four components: earliness, tardiness, window location and window size. The objective is to schedule the jobs and to assign the maintenance activity and due-windows such that the total cost among all the jobs is minimized. A polynomial-time algorithm with the running time not exceeding $O(n^2logn)$ to give a solution to this problem is introduced, where $n$ is the number of jobs.
Single Machine Slack Due-Window Assignment and Scheduling of Linear Time-Dependent Deteriorating Jobs and a Deteriorating Maintenance Activity
Bo Cheng, Ling Cheng
Open Access Library Journal (OALib Journal) , 2018, DOI: 10.4236/oalib.1104907
Abstract: In this paper, we consider the slack due-window assignment model and study a single machine scheduling problem of linear time-dependent deteriorating jobs and a deteriorating maintenance activity. The objective is to find the job schedule having an assigned maintenance activity and due-windows with the minimum total cost consisting of costs of earliness, tardiness, window location and window size. A polynomial-time algorithm is presented in this paper with time complexity for n jobs.
A fuzzy modeling for single machine scheduling problem with deteriorating jobs
Mohammad Mahavi Mazdeh,Farzad Zaerpour,Farzad Firouzi Jahantigh
International Journal of Industrial Engineering Computations , 2010,
Abstract: This paper addresses a bi-criteria scheduling problem with deteriorating jobs on a single machine. We develop a model for a single machine bi-criteria scheduling problem (SMBSP) with the aim of minimizing total tardiness and work in process (WIP) costs. WIP cost increases as a job passes through a series of stages in the production process. Due to the uncertainty involved in real-world scheduling problems, it is sometimes unrealistic or even impossible to acquire exact input data. Hence, we consider the SMBSP under the hypothesis of fuzzy L-R processing time's knowledge and fuzzy L-R due date. The effectiveness of the proposed model and the denoted methodology is demonstrated through a test problem.
Scheduling Jobs with Values Exponentially Deteriorating over Time in a Job Shop Environment
Cheng-Hsiang Liu
Lecture Notes in Engineering and Computer Science , 2011,
Abstract:
Scheduling step-deteriorating jobs to minimize the total weighted tardiness on a single machine  [PDF]
Peng Guo,Wenming Cheng,Yi Wang
Mathematics , 2014,
Abstract: This paper addresses the scheduling problem of minimizing the total weighted tardiness on a single machine with step-deteriorating jobs. With the assumption of deterioration, the job processing times are modeled by step functions of job starting times and pre-specified job deteriorating dates. The introduction of step-deteriorating jobs makes a single machine total weighted tardiness problem more intractable. The computational complexity of this problem under consideration was not determined. In this study, it is firstly proved to be strongly NP-hard. Then a mixed integer programming model is derived for solving the problem instances optimally. In order to tackle large-sized problems, seven dispatching heuristic procedures are developed for near-optimal solutions. Meanwhile, the solutions delivered by the proposed heuristic are further improved by a pair-wise swap movement. Computational results are presented to reveal the performance of all proposed approaches.
The Effect of the Workload on Due Date Performance in Job Shop Scheduling  [cached]
Miguel Cezar Santoro,Marco Aurélio Mesquita, de
Brazilian Journal of Operations & Production Management , 2010,
Abstract: This paper provides a simulation model to study the effect of the work-in-process control on due date performance in job shop environment. The due date performance is measured by both the number of tardy jobs and the total tardiness. The simulation runs include different shop configurations (flow shop and general job shop), workloads and sequencing rules. As expected, the results reveal that due date performance is highly dependent on the work-in-process, particularly after the system reaches saturation. Nevertheless, the model is very useful to show job shop managers the effect of the work-in-process control in the due date meeting performance.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.