Scheduling the two-machine open shop problem under resource constraints for setting the jobs

This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity. Then,...

Full description

Saved in:
Bibliographic Details
Published in:Annals of operations research 2013-12, Vol.211 (1), p.333-356
Main Authors: Oulamara, Ammar, Rebaine, Djamal, Serairi, Mehdi
Format: Article
Language:English
Subjects:
Algorithms
Business and Management
Combinatorics
Computer Science
Heuristic
Heuristic methods
Job shops
Operations Research
Operations Research/Decision Theory
Production scheduling
Renewable resources
Scheduling
Studies
Theory of Computation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c487t-afd8c1a47ec28108dbab70e09c54972ddb40fc8fd4a8659e4e191eb37cebf3183
cites cdi_FETCH-LOGICAL-c487t-afd8c1a47ec28108dbab70e09c54972ddb40fc8fd4a8659e4e191eb37cebf3183
container_end_page 356
container_issue 1
container_start_page 333
container_title Annals of operations research
container_volume 211
creator Oulamara, Ammar
Rebaine, Djamal
Serairi, Mehdi
description This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity. Then, it goes onto its execution while the resources allocated to it become available again. We seek a schedule that minimizes the makespan. We first prove the -hardness of several versions of this problem. Then, we present a well solvable case, lower bounds, and heuristic algorithms along with an experimental study.
doi_str_mv 10.1007/s10479-013-1446-9
format article
fullrecord <record><control><sourceid>gale_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_00920988v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A356352589</galeid><sourcerecordid>A356352589</sourcerecordid><originalsourceid>FETCH-LOGICAL-c487t-afd8c1a47ec28108dbab70e09c54972ddb40fc8fd4a8659e4e191eb37cebf3183</originalsourceid><addsrcrecordid>eNp1klGL1DAUhYsoOK7-AN8CvijYNWmSNnkcFnWFAR_UNyGk6W2boZOMue2K_96UqsyKEkjg8p0L5-QUxXNGrxmlzRtkVDS6pIyXTIi61A-KHZNNVWrO1cNiRyspSsk5fVw8QTxSShlTcld8_eRG6JbJh4HMI5D5eyxP1o0-AIlnCATHeCbnFNsJTmQJHSSSAOOSHBAXA87J-jAj6WMiCPP8e9Extvi0eNTbCeHZr_eq-PLu7eeb2_Lw8f2Hm_2hdEI1c2n7TjlmRQOuUoyqrrVtQ4FqJ4Vuqq5rBe2d6jthVS01CGCaQcsbB23PmeJXxatt72gnc07-ZNMPE603t_uDWWeU6opqpe5YZl9ubPb0bQGczcmjg2myAeKChgktuBRCVRl98Rd6zL5DdpKpuma81vUFNdgJjA99zJG4danZc1lzWUmlM3X9DyqfDk4-5wi9z_N7gtcXgnbB_COYL_TDOONgF8T7ONtwlyJigv5PDoyatSFma4jJDTFrQ8yqqTYNZjYMkC78_Vf0E_oNvHE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1466136962</pqid></control><display><type>article</type><title>Scheduling the two-machine open shop problem under resource constraints for setting the jobs</title><source>ABI/INFORM Global (ProQuest)</source><source>Springer Link</source><source>BSC - Ebsco (Business Source Ultimate)</source><creator>Oulamara, Ammar ; Rebaine, Djamal ; Serairi, Mehdi</creator><creatorcontrib>Oulamara, Ammar ; Rebaine, Djamal ; Serairi, Mehdi</creatorcontrib><description>This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity. Then, it goes onto its execution while the resources allocated to it become available again. We seek a schedule that minimizes the makespan. We first prove the -hardness of several versions of this problem. Then, we present a well solvable case, lower bounds, and heuristic algorithms along with an experimental study.</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-013-1446-9</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithms ; Business and Management ; Combinatorics ; Computer Science ; Heuristic ; Heuristic methods ; Job shops ; Operations Research ; Operations Research/Decision Theory ; Production scheduling ; Renewable resources ; Scheduling ; Studies ; Theory of Computation</subject><ispartof>Annals of operations research, 2013-12, Vol.211 (1), p.333-356</ispartof><rights>Springer Science+Business Media New York 2013</rights><rights>COPYRIGHT 2013 Springer</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c487t-afd8c1a47ec28108dbab70e09c54972ddb40fc8fd4a8659e4e191eb37cebf3183</citedby><cites>FETCH-LOGICAL-c487t-afd8c1a47ec28108dbab70e09c54972ddb40fc8fd4a8659e4e191eb37cebf3183</cites><orcidid>0000-0001-7694-601X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/1466136962/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/1466136962?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>230,314,776,780,881,11668,27903,27904,36039,36040,44342,74642</link.rule.ids><backlink>$$Uhttps://hal.science/hal-00920988$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Oulamara, Ammar</creatorcontrib><creatorcontrib>Rebaine, Djamal</creatorcontrib><creatorcontrib>Serairi, Mehdi</creatorcontrib><title>Scheduling the two-machine open shop problem under resource constraints for setting the jobs</title><title>Annals of operations research</title><addtitle>Ann Oper Res</addtitle><description>This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity. Then, it goes onto its execution while the resources allocated to it become available again. We seek a schedule that minimizes the makespan. We first prove the -hardness of several versions of this problem. Then, we present a well solvable case, lower bounds, and heuristic algorithms along with an experimental study.</description><subject>Algorithms</subject><subject>Business and Management</subject><subject>Combinatorics</subject><subject>Computer Science</subject><subject>Heuristic</subject><subject>Heuristic methods</subject><subject>Job shops</subject><subject>Operations Research</subject><subject>Operations Research/Decision Theory</subject><subject>Production scheduling</subject><subject>Renewable resources</subject><subject>Scheduling</subject><subject>Studies</subject><subject>Theory of Computation</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNp1klGL1DAUhYsoOK7-AN8CvijYNWmSNnkcFnWFAR_UNyGk6W2boZOMue2K_96UqsyKEkjg8p0L5-QUxXNGrxmlzRtkVDS6pIyXTIi61A-KHZNNVWrO1cNiRyspSsk5fVw8QTxSShlTcld8_eRG6JbJh4HMI5D5eyxP1o0-AIlnCATHeCbnFNsJTmQJHSSSAOOSHBAXA87J-jAj6WMiCPP8e9Extvi0eNTbCeHZr_eq-PLu7eeb2_Lw8f2Hm_2hdEI1c2n7TjlmRQOuUoyqrrVtQ4FqJ4Vuqq5rBe2d6jthVS01CGCaQcsbB23PmeJXxatt72gnc07-ZNMPE603t_uDWWeU6opqpe5YZl9ubPb0bQGczcmjg2myAeKChgktuBRCVRl98Rd6zL5DdpKpuma81vUFNdgJjA99zJG4danZc1lzWUmlM3X9DyqfDk4-5wi9z_N7gtcXgnbB_COYL_TDOONgF8T7ONtwlyJigv5PDoyatSFma4jJDTFrQ8yqqTYNZjYMkC78_Vf0E_oNvHE</recordid><startdate>20131201</startdate><enddate>20131201</enddate><creator>Oulamara, Ammar</creator><creator>Rebaine, Djamal</creator><creator>Serairi, Mehdi</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><general>Springer Verlag</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0001-7694-601X</orcidid></search><sort><creationdate>20131201</creationdate><title>Scheduling the two-machine open shop problem under resource constraints for setting the jobs</title><author>Oulamara, Ammar ; Rebaine, Djamal ; Serairi, Mehdi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c487t-afd8c1a47ec28108dbab70e09c54972ddb40fc8fd4a8659e4e191eb37cebf3183</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Business and Management</topic><topic>Combinatorics</topic><topic>Computer Science</topic><topic>Heuristic</topic><topic>Heuristic methods</topic><topic>Job shops</topic><topic>Operations Research</topic><topic>Operations Research/Decision Theory</topic><topic>Production scheduling</topic><topic>Renewable resources</topic><topic>Scheduling</topic><topic>Studies</topic><topic>Theory of Computation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Oulamara, Ammar</creatorcontrib><creatorcontrib>Rebaine, Djamal</creatorcontrib><creatorcontrib>Serairi, Mehdi</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Database‎ (1962 - current)</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global (ProQuest)</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering collection</collection><collection>ProQuest Central Basic</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Oulamara, Ammar</au><au>Rebaine, Djamal</au><au>Serairi, Mehdi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Scheduling the two-machine open shop problem under resource constraints for setting the jobs</atitle><jtitle>Annals of operations research</jtitle><stitle>Ann Oper Res</stitle><date>2013-12-01</date><risdate>2013</risdate><volume>211</volume><issue>1</issue><spage>333</spage><epage>356</epage><pages>333-356</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>This paper addresses the problem of open shop scheduling on two machines with resources constraints. In the context of our study, in order to be executed, a job requires first, for its preparation for a given period of time, a number of resources which cannot exceed a given resource capacity. Then, it goes onto its execution while the resources allocated to it become available again. We seek a schedule that minimizes the makespan. We first prove the -hardness of several versions of this problem. Then, we present a well solvable case, lower bounds, and heuristic algorithms along with an experimental study.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s10479-013-1446-9</doi><tpages>24</tpages><orcidid>https://orcid.org/0000-0001-7694-601X</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0254-5330
ispartof Annals of operations research, 2013-12, Vol.211 (1), p.333-356
issn 0254-5330
1572-9338
language eng
recordid cdi_hal_primary_oai_HAL_hal_00920988v1
source ABI/INFORM Global (ProQuest); Springer Link; BSC - Ebsco (Business Source Ultimate)
subjects Algorithms
Business and Management
Combinatorics
Computer Science
Heuristic
Heuristic methods
Job shops
Operations Research
Operations Research/Decision Theory
Production scheduling
Renewable resources
Scheduling
Studies
Theory of Computation
title Scheduling the two-machine open shop problem under resource constraints for setting the jobs
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T14%3A57%3A43IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Scheduling%20the%20two-machine%20open%20shop%20problem%20under%20resource%20constraints%20for%20setting%20the%20jobs&rft.jtitle=Annals%20of%20operations%20research&rft.au=Oulamara,%20Ammar&rft.date=2013-12-01&rft.volume=211&rft.issue=1&rft.spage=333&rft.epage=356&rft.pages=333-356&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-013-1446-9&rft_dat=%3Cgale_hal_p%3EA356352589%3C/gale_hal_p%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c487t-afd8c1a47ec28108dbab70e09c54972ddb40fc8fd4a8659e4e191eb37cebf3183%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1466136962&rft_id=info:pmid/&rft_galeid=A356352589&rfr_iscdi=true