Parallel-batch scheduling and transportation coordination with waiting time constraint.
This paper addresses a parallel-batch scheduling problem that incorporates transportation of raw materials or semifinished products before processing with waiting time constraint. The orders located at the different suppliers are transported by some vehicles to a manufacturing facility for further p...
| Publicado en: | Scientific World Journal pp. 356364 - 356365 |
|---|---|
| Autores principales: | , , |
| Formato: | research Journal Article |
| Publicado: |
Wiley-Blackwell
2014
|
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=ccm&AN=103826052&site=ehost-live header: @attributes: shortDbName: ccm uiTerm: 103826052 longDbName: CINAHL Complete uiTag: AN controlInfo: bkinfo: dissinfo: jinfo: jid: 1537744X 1BX5 jtl: Scientific World Journal issn: 1537744X maglogo: N pubinfo: dt: 2014 pid: 480 pub: Wiley-Blackwell place: Malden, Massachusetts artinfo: ui: 103826052 103826052 NLM24883385 2012601888 10.1155/2014/356364 NLM24883385 PMC4030492 103826052 ppf: 356364 ppct: 1 formats: tig: atl: Parallel-batch scheduling and transportation coordination with waiting time constraint. aug: au: Gong, Hua Chen, Daheng Xu, Ke affil: College of Science, Shenyang Ligong University, Shenyang 100159, China. sug: subj: Manufacturing Industry Methods Transportation Methods Transportation Standards Organizational Efficiency Manufacturing Industry Manufacturing Industry Standards Models, Theoretical Time Waiting Lists ab: This paper addresses a parallel-batch scheduling problem that incorporates transportation of raw materials or semifinished products before processing with waiting time constraint. The orders located at the different suppliers are transported by some vehicles to a manufacturing facility for further processing. One vehicle can load only one order in one shipment. Each order arriving at the facility must be processed in the limited waiting time. The orders are processed in batches on a parallel-batch machine, where a batch contains several orders and the processing time of the batch is the largest processing time of the orders in it. The goal is to find a schedule to minimize the sum of the total flow time and the production cost. We prove that the general problem is NP-hard in the strong sense. We also demonstrate that the problem with equal processing times on the machine is NP-hard. Furthermore, a dynamic programming algorithm in pseudopolynomial time is provided to prove its ordinarily NP-hardness. An optimal algorithm in polynomial time is presented to solve a special case with equal processing times and equal transportation times for each order. pubtype: Academic Journal doctype: research Journal Article ougenre: Article language: English refInfo: holdings: @attributes: islocal: N |
|---|