File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Just-in-time scheduling with machining economics for single-machine turning process

TitleJust-in-time scheduling with machining economics for single-machine turning process
Authors
KeywordsDue Window Scheduling
Just-In-Time
Machining Economics
Sequencing
Issue Date2000
PublisherElsevier Ltd. The Journal's web site is located at http://www.elsevier.com/locate/jmansys
Citation
Journal Of Manufacturing Systems, 2000, v. 19 n. 4, p. 219-228 How to Cite?
AbstractTraditional machining economics looks into the optimal set of machining conditions under which the production cost or time per part is minimized. No due dates are included in the consideration. Job sequencing searches for the optimal order of jobs so that lateness and/or earliness is minimized. The optimization assumes that processing times are fixed. In practice, processing times are variable within a certain range by adjusting the combination of machining conditions. This paper presents the modeling of a machining sequencing problem that is integrated with the lower-level machining process optimization problem of a turning process in a just-in-time delivery environment. A combination of dynamic programming and an enumerative procedure is used to solve the optimization problem.
Persistent Identifierhttp://hdl.handle.net/10722/177918
ISSN
2015 Impact Factor: 2.24
2015 SCImago Journal Rankings: 1.190
References

 

DC FieldValueLanguage
dc.contributor.authorLinn, RJen_US
dc.contributor.authorYen, Ben_US
dc.contributor.authorZhang, Wen_US
dc.date.accessioned2012-12-19T09:40:49Z-
dc.date.available2012-12-19T09:40:49Z-
dc.date.issued2000en_US
dc.identifier.citationJournal Of Manufacturing Systems, 2000, v. 19 n. 4, p. 219-228en_US
dc.identifier.issn0278-6125en_US
dc.identifier.urihttp://hdl.handle.net/10722/177918-
dc.description.abstractTraditional machining economics looks into the optimal set of machining conditions under which the production cost or time per part is minimized. No due dates are included in the consideration. Job sequencing searches for the optimal order of jobs so that lateness and/or earliness is minimized. The optimization assumes that processing times are fixed. In practice, processing times are variable within a certain range by adjusting the combination of machining conditions. This paper presents the modeling of a machining sequencing problem that is integrated with the lower-level machining process optimization problem of a turning process in a just-in-time delivery environment. A combination of dynamic programming and an enumerative procedure is used to solve the optimization problem.en_US
dc.languageengen_US
dc.publisherElsevier Ltd. The Journal's web site is located at http://www.elsevier.com/locate/jmansysen_US
dc.relation.ispartofJournal of Manufacturing Systemsen_US
dc.subjectDue Window Schedulingen_US
dc.subjectJust-In-Timeen_US
dc.subjectMachining Economicsen_US
dc.subjectSequencingen_US
dc.titleJust-in-time scheduling with machining economics for single-machine turning processen_US
dc.typeArticleen_US
dc.identifier.emailYen, B: benyen@hkucc.hku.hken_US
dc.identifier.authorityYen, B=rp01121en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1016/S0278-6125(01)80001-7-
dc.identifier.scopuseid_2-s2.0-0039332787en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0039332787&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume19en_US
dc.identifier.issue4en_US
dc.identifier.spage219en_US
dc.identifier.epage228en_US
dc.publisher.placeUnited Kingdomen_US
dc.identifier.scopusauthoridLinn, RJ=7005044059en_US
dc.identifier.scopusauthoridYen, B=7102564239en_US
dc.identifier.scopusauthoridZhang, W=36066941200en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats