.The job shop scheduling problem, in whicn we must determine the order or sequence for processing a set of jobs through several machines in an optimum manner, has received considerable attention. In this paper a number of the methods and techniques are reviewed and an attempt to categorize them according to their appropriateness for effective use in job shop scheduling has been made. Approaches...

The problem of scheduling in a Flow Shop with Multiple Processors (FSMP) is considered with the objective of minimizing the makespan for static problems. Herein, the usefulness of simulated annealing (SA) is investigated. Two stages are used in generating the makespans. A good initial-heuristic-seed sequence, obtained in the first stage, is improved-upon in the second stage by the SA technique....

Modern smartphones provide a high sophisticated camera and a high resolution display. Therefore, they can be used to enable various application scenarios for 1D and 2D barcode recognition as well as barcode presentation device. The device positioning against the barcode allows innovative interaction: e.g., additional product information or “rail information” on paper tickets. In the future, the...

INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY On Two Stage Open Shop Scheduling in Which Processing Time, Set Up Time Associated with Probabilities Including Job Block Criteria Deepak Gupta, Manjeet Kaur *1,2 Department of Mathematics, Maharishi Markandeshwar University, Mullana, Ambala, India [email protected] Abstract The present paper is an attempt through heu...

abstract: this paper considers the problem of scheduling n jobs on m unrelated parallel machines with sequence-dependent setup times. to better comply with industrial situations, jobs have varying due dates and ready times and there are some precedence relations between them. furthermore sequence-dependent setup times and anticipatory setups are included in the proposed model. the objective is ...

The current requirements of many manufacturing companies, such as the fashion, textile, and clothing industries, involve production multiple products with different processing routes short life cycles, which prevents obtaining deterministic setup times. Likewise, several industries present restrictions when changing from one reference to another in system, incurring variable sequence-dependent ...

A Job-Shop Scheduling is a process–organized manufacturing facility. Its main characteristics are that a great diversity of jobs is performed. A Job-Shop produces goods (parts) and these parts have one or more alternatives process plans. Each process plan consists of a sequence of a operations and these operations require resources and have certain (predefined) duration on machines. The Job-Sho...

Abstract In order to further reduce the carbon emission of manufacturing process in flexible job shop, a multi-objective integrated optimization model job-shop scheduling (FJSP) is proposed. A mathematics built this paper minimize makespan, total workload machines and emissions optimize method each machine characteristic, sequence allocation. Considering many parameters are interactional be opt...

In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...

With the development of Industry 4.0 and requirement smart factory, cellular manufacturing system (CMS) has been widely concerned in recent years, which may leads to reducing production cost wip inventory due its flexibility with groups. Intercellular transportation consumption, sequence-dependent setup times, batch issue CMS are taken into consideration simultaneously this paper. Afterwards, a...