EconPapers    
Economics at your fingertips  
 

Sequencing n jobs on two machines with setup, processing and removal times separated

Dileep R. Sule

Naval Research Logistics Quarterly, 1982, vol. 29, issue 3, 517-519

Abstract: The paper extends the machine flow‐shop scheduling problem by separating processing time into setup, processing and removal times.

Date: 1982
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/nav.3800290313

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:29:y:1982:i:3:p:517-519

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().

 
Page updated 2025-03-20
Handle: RePEc:wly:navlog:v:29:y:1982:i:3:p:517-519