Purchase a PDF
Purchase this article for $30.00 USD.
How does it work?
- Select the purchase option.
- Check out using a credit card or bank account with PayPal.
- Read your article online and download the PDF from your email or your account.
journal article
Job Shop Sequencing Problem on Two Machines with Time Lag ConstraintsManagement Science
Vol. 19, No. 9, Theory Series [May, 1973]
, pp. 1063-1066 [4 pages]
Published By: INFORMS
//www.jstor.org/stable/2629498
Read and download
Log in through your school or library
Purchase article
$30.00 - Download now and later
Abstract
The problem studied is that of two-machine job shop sequencing where some jobs are processed first on machine 1 and then on machine 2, while the remaining jobs are processed in the reverse order. The objective is to determine an ordered sequence which minimizes the total processing time, subject to some specified lag time constraints. A rule is given for determining two different sequences for the two machines which represent an optimal solution.
Journal Information
Management Science is a cross-functional, multidisciplinary examination of advances and solutions supporting enhanced strategic planning and management science. Includes relevant contributions from diverse fields: Accounting and finance Business strategy Decision analysis Information systems Manufacturing and distribution Marketing Mathematical programming and networks Organization performance Public sector applications R&D;/innovation Stochastic models and simulation Strategy and design Supply chain management
Publisher Information
With over 12,500 members from around the globe, INFORMS is the leading international association for professionals in operations research and analytics. INFORMS promotes best practices and advances in operations research, management science, and analytics to improve operational processes, decision-making, and outcomes through an array of highly-cited publications, conferences, competitions, networking communities, and professional development services.
Rights & Usage
This item is part of a JSTOR Collection.
For terms and use, please refer to our Terms and Conditions
Management Science © 1973 INFORMS
Request Permissions
Purchase a PDF
Purchase this article for $30.00 USD.
How does it work?
- Select the purchase option.
- Check out using a credit card or bank account with PayPal.
- Read your article online and download the PDF from your email or your account.
journal article
Sequencing n Jobs on Two Machines with Arbitrary Time LagsManagement Science
Vol. 5, No. 3 [Apr., 1959]
, pp. 293-298 [6 pages]
Published By: INFORMS
//www.jstor.org/stable/2626988
Read and download
Log in through your school or library
Purchase article
$30.00 - Download now and later
Abstract
Each of n jobs must be run first on machine I and then on machine II. Running times for each job on each machine are given. Also specified are arbitrary time lags which prescribe that a job may not be started [completed] on machine II until at least a certain time has elapsed since starting [completing] the job on machine I. A rule is given for determining the sequence in which jobs are to be run on the machines-using the same sequence for both machines-in order to minimize the time between the start of production of the first job on machine I and the completion of production of the last job on machine II.
Journal Information
Management Science is a cross-functional, multidisciplinary examination of advances and solutions supporting enhanced strategic planning and management science. Includes relevant contributions from diverse fields: Accounting and finance Business strategy Decision analysis Information systems Manufacturing and distribution Marketing Mathematical programming and networks Organization performance Public sector applications R&D;/innovation Stochastic models and simulation Strategy and design Supply chain management
Publisher Information
With over 12,500 members from around the globe, INFORMS is the leading international association for professionals in operations research and analytics. INFORMS promotes best practices and advances in operations research, management science, and analytics to improve operational processes, decision-making, and outcomes through an array of highly-cited publications, conferences, competitions, networking communities, and professional development services.
Rights & Usage
This item is part of a JSTOR Collection.
For terms and use, please refer to our Terms and Conditions
Management Science © 1959
INFORMS
Request Permissions