Optimal Lot Sizing Under Carload Discount Schedules
In order to encourage customers to buy more of an item, suppliers often offer discount schedules, most common ones being all-units and incremental discounts. The carload discounts schedule is one of the simplest schedules that are commonly used in practice. In this paper, an optimal lot sizing proce...
Gespeichert in:
Veröffentlicht in: | INFOR. Information systems and operational research 2005-11, Vol.43 (4), p.361-370 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 370 |
---|---|
container_issue | 4 |
container_start_page | 361 |
container_title | INFOR. Information systems and operational research |
container_volume | 43 |
creator | Elhedhli, Samir Benli, Ömer |
description | In order to encourage customers to buy more of an item, suppliers often offer discount schedules, most common ones being all-units and incremental discounts. The carload discounts schedule is one of the simplest schedules that are commonly used in practice. In this paper, an optimal lot sizing procedure is developed for this model. It turns out that the procedure is extremely simple, contrary to the expectations reported in the literature. |
doi_str_mv | 10.1080/03155986.2005.11732735 |
format | Article |
fullrecord | <record><control><sourceid>proquest_infor</sourceid><recordid>TN_cdi_proquest_journals_228518784</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>982180621</sourcerecordid><originalsourceid>FETCH-LOGICAL-c340t-298d5ee2d80b7220c7006d95c158fd7896b079fada6ed93a4d48dccfb400dfeb3</originalsourceid><addsrcrecordid>eNqFkMtOwzAQRS0EEqXwCyhinzK240eWVXlKkbqAri3HD0iVxsVOhMrXk6h0zWoWc-4dzUHoFsMCg4R7oJixUvIFAWALjAUlgrIzNMMl5jlwzM7RbILyibpEVyltATChAs8QXe_7ZqfbrAp99tb8NN1Htumsi9lKxzZomz00yYShG7fm09mhdekaXXjdJnfzN-do8_T4vnrJq_Xz62pZ5YYW0OeklJY5R6yEWhACRgBwWzKDmfRWyJLXIEqvrebOllQXtpDWGF8XANa7ms7R3bF3H8PX4FKvtmGI3XhSESIZlkIWI8SPkIkhpei82sfxoXhQGNTkR538qMmPOvkZg8tjsOl8iDv9HWJrVa8PbYg-6s40SdF_On4BNuZruQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>228518784</pqid></control><display><type>article</type><title>Optimal Lot Sizing Under Carload Discount Schedules</title><source>EBSCOhost Business Source Complete</source><creator>Elhedhli, Samir ; Benli, Ömer</creator><creatorcontrib>Elhedhli, Samir ; Benli, Ömer</creatorcontrib><description>In order to encourage customers to buy more of an item, suppliers often offer discount schedules, most common ones being all-units and incremental discounts. The carload discounts schedule is one of the simplest schedules that are commonly used in practice. In this paper, an optimal lot sizing procedure is developed for this model. It turns out that the procedure is extremely simple, contrary to the expectations reported in the literature.</description><identifier>ISSN: 0315-5986</identifier><identifier>EISSN: 1916-0615</identifier><identifier>DOI: 10.1080/03155986.2005.11732735</identifier><identifier>CODEN: INFRCL</identifier><language>eng</language><publisher>Ottawa: Taylor & Francis</publisher><subject>Discounts ; Mathematical models ; Optimization ; Scheduling ; Studies</subject><ispartof>INFOR. Information systems and operational research, 2005-11, Vol.43 (4), p.361-370</ispartof><rights>Copyright 2005 Taylor and Francis Group LLC 2005</rights><rights>Copyright Canadian Operational Research Society Nov 2005</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c340t-298d5ee2d80b7220c7006d95c158fd7896b079fada6ed93a4d48dccfb400dfeb3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Elhedhli, Samir</creatorcontrib><creatorcontrib>Benli, Ömer</creatorcontrib><title>Optimal Lot Sizing Under Carload Discount Schedules</title><title>INFOR. Information systems and operational research</title><description>In order to encourage customers to buy more of an item, suppliers often offer discount schedules, most common ones being all-units and incremental discounts. The carload discounts schedule is one of the simplest schedules that are commonly used in practice. In this paper, an optimal lot sizing procedure is developed for this model. It turns out that the procedure is extremely simple, contrary to the expectations reported in the literature.</description><subject>Discounts</subject><subject>Mathematical models</subject><subject>Optimization</subject><subject>Scheduling</subject><subject>Studies</subject><issn>0315-5986</issn><issn>1916-0615</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNqFkMtOwzAQRS0EEqXwCyhinzK240eWVXlKkbqAri3HD0iVxsVOhMrXk6h0zWoWc-4dzUHoFsMCg4R7oJixUvIFAWALjAUlgrIzNMMl5jlwzM7RbILyibpEVyltATChAs8QXe_7ZqfbrAp99tb8NN1Htumsi9lKxzZomz00yYShG7fm09mhdekaXXjdJnfzN-do8_T4vnrJq_Xz62pZ5YYW0OeklJY5R6yEWhACRgBwWzKDmfRWyJLXIEqvrebOllQXtpDWGF8XANa7ms7R3bF3H8PX4FKvtmGI3XhSESIZlkIWI8SPkIkhpei82sfxoXhQGNTkR538qMmPOvkZg8tjsOl8iDv9HWJrVa8PbYg-6s40SdF_On4BNuZruQ</recordid><startdate>20051101</startdate><enddate>20051101</enddate><creator>Elhedhli, Samir</creator><creator>Benli, Ömer</creator><general>Taylor & Francis</general><general>Canadian Operational Research Society</general><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>4T-</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</scope><scope>8AO</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>8FQ</scope><scope>8FV</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>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>M0C</scope><scope>M0N</scope><scope>M3G</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PYYUZ</scope><scope>Q9U</scope><scope>S0X</scope></search><sort><creationdate>20051101</creationdate><title>Optimal Lot Sizing Under Carload Discount Schedules</title><author>Elhedhli, Samir ; Benli, Ömer</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c340t-298d5ee2d80b7220c7006d95c158fd7896b079fada6ed93a4d48dccfb400dfeb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Discounts</topic><topic>Mathematical models</topic><topic>Optimization</topic><topic>Scheduling</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Elhedhli, Samir</creatorcontrib><creatorcontrib>Benli, Ömer</creatorcontrib><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Docstoc</collection><collection>Access via ABI/INFORM (ProQuest)</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</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>Canadian Business & Current Affairs Database</collection><collection>Canadian Business & Current Affairs Database (Alumni Edition)</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</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>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>CBCA Reference & Current Events</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & 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>ABI/INFORM Collection China</collection><collection>ProQuest Central Basic</collection><collection>SIRS Editorial</collection><jtitle>INFOR. Information systems and operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Elhedhli, Samir</au><au>Benli, Ömer</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Optimal Lot Sizing Under Carload Discount Schedules</atitle><jtitle>INFOR. Information systems and operational research</jtitle><date>2005-11-01</date><risdate>2005</risdate><volume>43</volume><issue>4</issue><spage>361</spage><epage>370</epage><pages>361-370</pages><issn>0315-5986</issn><eissn>1916-0615</eissn><coden>INFRCL</coden><abstract>In order to encourage customers to buy more of an item, suppliers often offer discount schedules, most common ones being all-units and incremental discounts. The carload discounts schedule is one of the simplest schedules that are commonly used in practice. In this paper, an optimal lot sizing procedure is developed for this model. It turns out that the procedure is extremely simple, contrary to the expectations reported in the literature.</abstract><cop>Ottawa</cop><pub>Taylor & Francis</pub><doi>10.1080/03155986.2005.11732735</doi><tpages>10</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0315-5986 |
ispartof | INFOR. Information systems and operational research, 2005-11, Vol.43 (4), p.361-370 |
issn | 0315-5986 1916-0615 |
language | eng |
recordid | cdi_proquest_journals_228518784 |
source | EBSCOhost Business Source Complete |
subjects | Discounts Mathematical models Optimization Scheduling Studies |
title | Optimal Lot Sizing Under Carload Discount Schedules |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T13%3A07%3A48IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_infor&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Optimal%20Lot%20Sizing%20Under%20Carload%20Discount%20Schedules&rft.jtitle=INFOR.%20Information%20systems%20and%20operational%20research&rft.au=Elhedhli,%20Samir&rft.date=2005-11-01&rft.volume=43&rft.issue=4&rft.spage=361&rft.epage=370&rft.pages=361-370&rft.issn=0315-5986&rft.eissn=1916-0615&rft.coden=INFRCL&rft_id=info:doi/10.1080/03155986.2005.11732735&rft_dat=%3Cproquest_infor%3E982180621%3C/proquest_infor%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=228518784&rft_id=info:pmid/&rfr_iscdi=true |