The discrete resource allocation problem in flow lines

Simple item page
dc.citation.epage1431en_US
dc.citation.issueNumber9en_US
dc.citation.spage1417en_US
dc.citation.volumeNumber41en_US
dc.contributor.authorKarabati, S.en_US
dc.contributor.authorKouvelis, P.en_US
dc.contributor.authorYu, G.en_US
dc.date.accessioned2019-02-07T08:37:17Z
dc.date.available2019-02-07T08:37:17Z
dc.date.issued1995en_US
dc.departmentDepartment of Managementen_US
dc.description.abstractIn this paper we address the discrete resource allocation problem in a deterministic flow line. We assume that the processing times are convex and noningcreasing in the amount of resources allocated to the machines. We consider the resource allocation problem for a fixed sequence of jobs for various performance criteria (makespan, weighted sum of completion times, cycle time for cyclic schedules) and develop a formulation of the problem as a convex program, where the number of constraints grows exponentially with the number of jobs and machines. We also present a generalization of the formulation for resource allocation problems in a cyclic directed graphs. We demonstrate that the problem is NP-complete in the strong sense and present an effective solution procedure. The solution procedure is an implicit enumeration scheme where a surrogate relaxation of the formulation is used to generate upper and lower bounds on the optimal objective function value. Finally, we address the simultaneous scheduling and resource allocation problem, and we present an approximate and iterative solution procedure for the problem.en_US
dc.description.provenanceSubmitted by Merve Nalbant (merve.nalbant@bilkent.edu.tr) on 2019-02-07T08:37:17Z No. of bitstreams: 1 The_discrete_source_allocation_problem_in_flow_lines.pdf: 1073866 bytes, checksum: 1dfdc4741f95610409449fdae28a82d2 (MD5)en
dc.description.provenanceMade available in DSpace on 2019-02-07T08:37:17Z (GMT). No. of bitstreams: 1 The_discrete_source_allocation_problem_in_flow_lines.pdf: 1073866 bytes, checksum: 1dfdc4741f95610409449fdae28a82d2 (MD5) Previous issue date: 1995en
dc.identifier.eissn1526-5501
dc.identifier.issn0025-1909
dc.identifier.urihttp://hdl.handle.net/11693/48997
dc.language.isoEnglishen_US
dc.publisherInstitute for Operations Research and the Management Sciences (INFORMS)en_US
dc.source.titleManagement Scienceen_US
dc.subjectResource allocationen_US
dc.subjectFlow shop schedulingen_US
dc.subjectInteger programmingen_US
dc.subjectSurrogate relaxationen_US
dc.titleThe discrete resource allocation problem in flow linesen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
The_discrete_source_allocation_problem_in_flow_lines.pdf
Size:
1.02 MB
Format:
Adobe Portable Document Format
Description:
Full printable version
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Management