Main Page
Welcome
About the Center
About The SPC
Mission and Vision
Organizational Structure
Spc Directors
Facts and Figures
Services
ِActivities
Exhibitions
Print Exhibition
Books Exhibition
Visits
Training
Workshops
Courses
Seminars
Conventions
Celebrations
Research
Favorite Links
Contact Us
PhotoAlbum
Contact Us
Researches
عربي
English
About
Admission
Academic
Research and Innovations
University Life
E-Services
Search
Scientific Publishing Center
Document Details
Document Type
:
Article In Journal
Document Title
:
A Branch and Bound Algorithm for Job-Shop Scheduling
أسلوب (1) فرعٍ وحَدًّ لمشكلة تنظيم الأعمال في ورشة تعاقدية
Subject
:
mathematics
Document Language
:
English
Abstract
:
The problem of scheduling jobs in a general job-shop to minimize the maximum completion time is considered. A branch and bound algorithm is proposed. The lower bound is obtained from the preemptive schedules which fqrm solutions of single machine subproblems. In the branching rule, a set of operations which each require the same machine is selected and branches of the search tree corresponding to the possibilities that an operation of this set is sequenced before (or after) the optohretersd.. Computational experience with a v.ariety of test problems is re- ported
ISSN
:
1012-1319
Journal Name
:
Science Journal
Volume
:
3
Issue Number
:
1
Publishing Year
:
1411 AH
1991 AD
Number Of Pages
:
8
Article Type
:
Article
Added Date
:
Sunday, October 11, 2009
Researchers
Researcher Name (Arabic)
Researcher Name (English)
Researcher Type
Dr Grade
Email
أحمد محمد حريري
A. M .A. HARIRI
Researcher
كريس ن . بونس
C. N. Pons
Researcher
Files
File Name
Type
Description
22646.pdf
pdf
Back To Researches Page