نتایج جستجو برای: job shop scheduling
تعداد نتایج: 137905 فیلتر نتایج به سال:
In this work we consider the Single Track Train Scheduling Problem. The problem consists in scheduling a set of trains from opposite sides along a single track. The track passes intermediate stations and the trains are only allowed to pass each other at those stations. This problem has a close relation to minimizing the makespan in a job shop scheduling problem with two counter routes and no pr...
Job scheduling under the cloud circumstance is the key techniques to impact on frequency of cloud calculation. Trust relationship is an important factor of cloud calculation and job scheduling. In order to satisfy the requirement of quality of cloud calculation service for job scheduling, this article introduced the term of trust mechanism and apply it to cloud calculation and job scheduling. I...
In the job shop scheduling problem (JSP), a finite set of jobs is processed on a finite set of machines. Each job is characterized by a fixed order of operations, each of which is to be processed on a specific machine for a specified duration. Each machine can process at most one job at a time and once a job initiates processing on a given machine it must complete processing uninterrupted. A sc...
Traditionally, scheduling and process planning are considered as two different functions in a manufacturing environment. In this paper we consider the simultaneous selection of best process plan and scheduling of jobs in a job shop environment. We propose a spreadsheet based genetic algorithm (GA) to solve this class of problem. The shop model is built in Microsoft Excel spreadsheet to find the...
This work studies the performance of two Mixed Integer Linear Programming (MILP) models to solve scheduling problems in a flexible job shop environment with recirculation and assembly using a due-date-based objective function. The models convey different approaches both in the modelling of time (discrete and continuous approaches) as well as in the assignment of jobs to machines. The comparison...
This paper is concerned with detailed scheduling of job-shop like manufacturing systems. It addresses the scheduling of jobs, either simple, requiring the manufacture of a batch of parts, i.e. simple products, or complex, comprehending the parts fabrication and their multistage assembly into a batch of products. The Product-oriented Scheduling approach was adopted, assuming that full scheduling...
In the recent years, constraint programming has been applied to a wide variety of academic and industrial non-preemptive scheduling problems, i.e., problems in which activities cannot be interrupted. In comparison, preemptive scheduling problems have received almost no attention from both the Operations Research and the Artificial Intelligence community (see, for example, (Demeulemeester, 1992)...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید