Advanced search
Publication Cover
A I I E Transactions Volume 12, 1980 - Issue 3
Journal homepage
115
Views
172
CrossRef citations to date
0
Altmetric
Original Articles

Two Single Machine Sequencing Problems Involving Controllable Job Processing Times

R. G. Vickson Department of Management Sciences, University of Waterloo Waterloo, Ontario, Canada, N2L 3G1
Pages 258-262 | Received 01 Nov 1979, Published online: 06 Jul 2007
 
Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days

Abstract

This paper presents simple methods for solving two single machine sequencing problems when job processing times are themselves decision variables having their own associated linearly varying costs. These are the problems of minimizing the total processing cost plus either the average flow cost or the maximum tardiness cost. The paper treats only problems with zero ready times and no precedence constraints.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related Research Data

Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions
Source: Informa UK Limited
Parallel machines scheduling with deterioration effects and resource allocations
Source: Informa UK Limited
Single machine batch scheduling to minimize total completion time and resource consumption costs
Source: Springer Science and Business Media LLC
Single machine scheduling with controllable processing times by submodular optimization
Source: World Scientific Pub Co Pte Lt
Batch scheduling with controllable setup and processing times to minimize total completion time
Source: Informa UK Limited
Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity
Source: Informa UK Limited
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
Source: Springer US
A unified view of parallel machine scheduling with interdependent processing rates
Source: Springer Science and Business Media LLC
Finding an Optimal Sequence by Dynamic Programming: An Extension to Precedence-Related Tasks
Source: Institute for Operations Research and the Management Sciences (INFORMS)
An intelligent water drop algorithm to identical parallel machine scheduling with controllable processing times: a just-in-time approach
Source: Springer Science and Business Media LLC
Proportionate Flow Shop Equivalence
Source: Wiley
Scheduling flow shops with operators
Source: Informa UK Limited
Various optimizers for single‐stage production
Source: Wiley
Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity
Source: Informa UK Limited

Linking provided by 

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.