OPTIMAL SCHEDULE IN A GT-TYPE FLOW-SHOP UNDER SERIES-PARALLEL PRECEDENCE CONSTRAINTS
نویسندگان
چکیده
منابع مشابه
An algebraic approach to project schedule development under precedence constraints
An approach to schedule development in project management is developed within the framework of idempotent algebra. The approach offers a way to represent precedence relationships among activities in projects as linear vector equations in terms of an idempotent semiring. As a result, many issues in project scheduling reduce to solving computational problems in the idempotent algebra setting, inc...
متن کاملOptimal Scheduling on Parallel Processors under Precedence Constraints and General Costs
We consider preemptive and nonpreemptive scheduling of partially ordered tasks on parallel processors, where the precedence relations have an interval order, an in-forest, or a uniform out-forest structure. Processing times of tasks are random variables with an ILR (increasing in likelihood ratio) distribution in the nonpreemptive case and an exponential distribution in the preemptive case. We ...
متن کاملSeries-p Arallel Precedence Constraints
The following two-machine flow-shop scheduling problem is solved. Given jobs are classified into groups, and each machine needs some setup before the first job in a group is started processing. If a job in a group is started its process, all jobs in the group must be finished before a job in another group is processed. Each job may have a specified lag time between machines. Moreover, a series-...
متن کاملA Heuristic Serial Schedule Algorithm for Unrelated Parallel Machine Scheduling With Precedence Constraints
The paper presents a priority rule-based heuristic serial schedule (SS) algorithm for a deterministic scheduling problem where multiple jobs with arbitrary precedence constraints are processed on multiple unrelated parallel machines. The objective is to minimise makespan. The priority rule employs the arithmetic mean and deviation of the processing times to determine the prior job-machine pair....
متن کاملFlexible job shop scheduling under availability constraints
In this paper, an exact geometric algorithm is presented for solving two-job sequencing and scheduling problems in flexible flow shop and job shop environments while the resources are (un)available in some time periods and processors (un)availability is the same in all work centers. This study seems utterly new and it is applicable to any performance measure based on the completion time. The in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1983
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.26.226