Just-in-time scheduling models and algorithms for computer and manufacturing systems /
As the field of Supply Chain Management has matured, maintaining the precise flow of goods to maintain schedules (hence, minimizing inventories) on a just-in-time basis still remains as a major challenge. This problem or challenge has resulted in a fair amount of quantitative research in the area, p...
| Other Authors: | Józefowska, Joanna., SpringerLink (Online service) |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York :
Springer,
©2007.
New York : [2007] |
| Physical Description: |
1 online resource (xiii, 255 pages) : illustrations. |
| Series: |
International series in operations research & management science ;
106. |
| Subjects: |
| LEADER | 09793cam a2201285 a 4500 | ||
|---|---|---|---|
| 001 | 187108988 | ||
| 003 | OCoLC | ||
| 005 | 20240223121953.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 080103s2007 nyua ob 001 0 eng d | ||
| 010 | |z 2007926587 | ||
| 019 | |a 184909850 |a 288288698 |a 318245883 |a 606614931 |a 607259289 |a 613672625 |a 648318167 |a 739130249 |a 746953688 |a 777965618 |a 880105940 |a 900027019 |a 985051022 |a 994784101 |a 1005788223 |a 1035667444 |a 1044272951 |a 1056315037 |a 1058215446 |a 1077265675 |a 1086435622 |a 1087471632 |a 1097301001 |a 1102279521 |a 1110810411 |a 1153005886 |a 1393045655 | ||
| 020 | |a 9780387717180 | ||
| 020 | |a 0387717188 | ||
| 020 | |a 038771717X | ||
| 020 | |a 9780387717173 | ||
| 020 | |a 9781441944030 | ||
| 020 | |a 1441944036 | ||
| 020 | |a 1280960140 | ||
| 020 | |a 9781280960147 | ||
| 020 | |a 9786610960149 | ||
| 020 | |a 6610960143 | ||
| 024 | 7 | |a 10.1007/978-0-387-71718-0 |2 doi | |
| 035 | |a (OCoLC)187108988 |z (OCoLC)184909850 |z (OCoLC)288288698 |z (OCoLC)318245883 |z (OCoLC)606614931 |z (OCoLC)607259289 |z (OCoLC)613672625 |z (OCoLC)648318167 |z (OCoLC)739130249 |z (OCoLC)746953688 |z (OCoLC)777965618 |z (OCoLC)880105940 |z (OCoLC)900027019 |z (OCoLC)985051022 |z (OCoLC)994784101 |z (OCoLC)1005788223 |z (OCoLC)1035667444 |z (OCoLC)1044272951 |z (OCoLC)1056315037 |z (OCoLC)1058215446 |z (OCoLC)1077265675 |z (OCoLC)1086435622 |z (OCoLC)1087471632 |z (OCoLC)1097301001 |z (OCoLC)1102279521 |z (OCoLC)1110810411 |z (OCoLC)1153005886 |z (OCoLC)1393045655 | ||
| 037 | |a 978-0-387-71717-3 |b Springer |n http://www.springerlink.com | ||
| 040 | |a GW5XE |b eng |e pn |c GW5XE |d GW5XE |d YDXCP |d TEX |d HNK |d NUI |d N$T |d OCLCQ |d IDEBK |d OCLCQ |d YNG |d MND |d E7B |d UBC |d ISOBC |d OCLCQ |d OCLCF |d BEDGE |d DKDLA |d OCLCQ |d OCLCO |d OCLCQ |d VT2 |d Z5A |d OTZ |d OCLCQ |d UAB |d ESU |d OCLCQ |d STF |d OCLCQ |d CEF |d U3W |d OCLCQ |d WYU |d ICG |d YOU |d CANPU |d OCLCQ |d W2U |d LEAUB |d CNTRU |d AUD |d OCLCQ |d AU@ |d OCLCQ |d WURST |d OCLCQ |d OCLCO |d OCLCQ |d INARC |d OCLCO |d OCLCL | ||
| 049 | |a COM6 | ||
| 050 | 4 | |a TS157.5 |b .J87 2007eb | |
| 072 | 7 | |a TEC |x 018000 |2 bisacsh | |
| 072 | 7 | |a TEC |x 009060 |2 bisacsh | |
| 072 | 7 | |a BUS |x 087000 |2 bisacsh | |
| 072 | 7 | |a TGP |2 bicssc | |
| 082 | 0 | 4 | |a 658.53 |2 22 |
| 245 | 0 | 0 | |a Just-in-time scheduling : |b models and algorithms for computer and manufacturing systems / |c edited by Joanna Józefowska. |
| 260 | |a New York : |b Springer, |c ©2007. | ||
| 264 | 1 | |a New York : |b Springer, |c [2007] | |
| 264 | 4 | |c ©2007. | |
| 300 | |a 1 online resource (xiii, 255 pages) : |b illustrations. | ||
| 336 | |a text |b txt |2 rdacontent. | ||
| 337 | |a computer |b c |2 rdamedia. | ||
| 338 | |a online resource |b cr |2 rdacarrier. | ||
| 347 | |a text file. | ||
| 347 | |b PDF. | ||
| 490 | 1 | |a International series in operations research & management science ; |v 106. | |
| 504 | |a Includes bibliographical references (pages 235-251) and index. | ||
| 588 | 0 | |a Print version record. | |
| 505 | 0 | |a 1. Just-in-time concept in manufacturing and computer systems -- 1.1. Manufacturing systems -- 1.1.1. Production planning and control -- 1.1.2. Just-in-time systems -- 1.1.3. Balanced schedules -- 1.1.4. Earliness and tardiness cost -- 1.2. Computer systems -- 1.2.1. Real-time systems -- 1.2.2. Hard real-time systems -- 1.2.3. Soft real-time systems -- 2. Methodological background -- 2.1. Deterministic scheduling theory -- 2.1.1. Basic definitions -- 2.1.2. Earliness and tardiness cost functions -- 2.1.3. Scheduling algorithms and computational complexity -- 2.2. The Theory of Apportionment -- 2.2.1. Problem formulation -- 2.2.2. Divisor methods -- 2.2.3. Staying within the quota -- 2.2.4. Impossibility Theorem -- 3. Common due date -- 3.1. Linear cost functions -- 3.1.1. Mean Absolute Deviation -- 3.1.2. Weighted Sum of Absolute Deviations -- 3.1.3. Symmetric weights -- 3.1.4. Total Weighted Earliness and Tardiness -- 3.1.5. Controllable due date -- 3.1.6. Controllable processing times -- 3.1.7. Resource dependent ready times -- 3.1.8. Common due window -- 3.2. Quadratic cost function -- 3.2.1. Completion Time Variance -- 3.2.2. Restricted MSD problem -- 3.2.3. Other models -- 4. Individual due dates -- 4.1. Schedules with idle time -- 4.1.1. Arbitrary weights -- 4.1.2. Proportional weights -- 4.1.3. Mean absolute lateness -- 4.1.4. Maximizing the number of just-in-time tasks -- 4.1.5. Minimizing the maximum earliness/tardiness cost -- 4.1.6. Scheduling with additional resources -- 4.1.7. Other models -- 4.2. Schedules without idle time -- 4.2.1. Arbitrary weights -- 4.2.2. Task independent weights -- 4.3. Controllable due dates -- 4.3.1. TWK due date model -- 4.3.2. SLK due date model -- 4.3.3. Scheduling with batch setup times -- 5. Algorithms for schedule balancing. | |
| 505 | 0 | |a 5.1. The multi-level scheduling problem -- 5.1.1. Problem formulation -- 5.1.2. Minimizing the maximum deviation -- 5.1.3. Minimizing the total deviation -- 5.2. The single-level scheduling problem -- 5.2.1. Problem formulation -- 5.2.2. Minimizing the maximum deviation -- 5.2.3. Minimizing the total deviation -- 5.2.4. Cyclic sequences -- 5.2.5. Transformation of the PRV problem to the apportionment problem -- 5.3. Scheduling periodic tasks -- 5.3.1. Problem formulation -- 5.3.2. Scheduling algorithms -- 5.3.3. Properties of feasible schedules. | |
| 520 | |a As the field of Supply Chain Management has matured, maintaining the precise flow of goods to maintain schedules (hence, minimizing inventories) on a just-in-time basis still remains as a major challenge. This problem or challenge has resulted in a fair amount of quantitative research in the area, producing an array of models and algorithms to help ensure the precise flow of components and final products into inventories to meet just-in-time requirements. Just-in-Time Scheduling: Models and Algorithms for Computer and Manufacturing Systems is the first expository treatment surveying the theoretical work on computer systems models and algorithms utilized in just-in-time scheduling. With the impact of globalization and supply chains on manufacturing, there are immense amounts of material flowing through supply chains at any given time worldwide. Therefore the scheduling of all the stages of material arriving at different geographical points at precise times is a highly significant problem. Moreover, the theoretical work in this area has larger ramifications for operational scheduling in many application areas. The scheduling models and algorithms presented and illustrated in the book will be done so in the context of extensive use of computer systems in a "real time context." The "just-in-time" and "real-time" theoretical work in the book will be of value and interest to many Engineers, Computer Scientists and Operations Research/Management Science researchers, students and practitioners. The book will survey and synthesize all the research in this topical area. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Production scheduling |x Mathematical models. | |
| 650 | 0 | |a Just-in-time systems. | |
| 650 | 0 | |a Business logistics. | |
| 650 | 6 | |a Logistique (Organisation) | |
| 650 | 6 | |a Juste-à-temps (Système) | |
| 650 | 6 | |a Ordonnancement (Gestion) |x Modèles mathématiques. | |
| 650 | 7 | |a TECHNOLOGY & ENGINEERING |x Industrial Technology. |2 bisacsh. | |
| 650 | 7 | |a TECHNOLOGY & ENGINEERING |x Industrial Engineering. |2 bisacsh. | |
| 650 | 7 | |a BUSINESS & ECONOMICS |x Production & Operations Management. |2 bisacsh. | |
| 650 | 7 | |a Affaires. |2 eclas. | |
| 650 | 7 | |a Science économique. |2 eclas. | |
| 650 | 7 | |a Economie de l'entreprise. |2 eclas. | |
| 650 | 7 | |a Business logistics. |2 fast. | |
| 650 | 7 | |a Just-in-time systems. |2 fast. | |
| 650 | 7 | |a Production scheduling |x Mathematical models. |2 fast. | |
| 653 | 0 | 0 | |a economie. |
| 653 | 0 | 0 | |a economics. |
| 653 | 0 | 0 | |a bedrijfswetenschap. |
| 653 | 0 | 0 | |a management science. |
| 653 | 0 | 0 | |a engineering. |
| 653 | 0 | 0 | |a industrie. |
| 653 | 0 | 0 | |a industry. |
| 653 | 0 | 0 | |a bedrijfsvoering. |
| 653 | 0 | 0 | |a management. |
| 653 | 0 | 0 | |a operationeel onderzoek. |
| 653 | 0 | 0 | |a operations research. |
| 653 | 0 | 0 | |a logistiek. |
| 653 | 0 | 0 | |a logistics. |
| 653 | 1 | 0 | |a Management studies, Business Administration, Organizational Science (General) |
| 653 | 2 | 0 | |a Economics (General) |
| 653 | 1 | 0 | |a Management, bedrijfskunde, organisatiekunde (algemeen) |
| 653 | 2 | 0 | |a Economie (algemeen) |
| 700 | 1 | |a Józefowska, Joanna. | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 776 | 0 | 8 | |i Print version: |t Just-in-time scheduling. |d New York : Springer, ©2007 |z 038771717X |z 9780387717173 |w (DLC) 2007926587 |w (OCoLC)153576634. |
| 830 | 0 | |a International series in operations research & management science ; |v 106. | |
| 907 | |a .b29514320 |b multi |c - |d 100215 |e 240320 | ||
| 998 | |a (3)cue |a cu |b 240227 |c m |d z |e - |f eng |g nyu |h 0 |i 2 | ||
| 948 | |a MARCIVE Overnight, in 2024.03 | ||
| 948 | |a MARCIVE Comp, in 2022.12 | ||
| 948 | |a MARCIVE Over, 07/2021 | ||
| 948 | |a MARCIVE Comp, 2018.05 | ||
| 948 | |a MARCIVE August, 2017 | ||
| 948 | |a MARCIVE extract Aug 5, 2017 | ||
| 994 | |a 92 |b COM | ||
| 995 | |a Loaded with m2btab.ltiac in 2024.03 | ||
| 995 | |a Loaded with m2btab.elec in 2024.02 | ||
| 995 | |a Loaded with m2btab.ltiac in 2022.12 | ||
| 995 | |a Loaded with m2btab.ltiac in 2021.07 | ||
| 995 | |a Loaded with m2btab.elec in 2021.06 | ||
| 995 | |a Loaded with m2btab.ltiac in 2018.06 | ||
| 995 | |a Loaded with m2btab.ltiac in 2017.08 | ||
| 995 | |a Loaded with m2btab.elec in 2016 | ||
| 995 | |a Loaded with m2btab.elec in 2016 | ||
| 995 | |a Loaded with m2btab.elec in 2016 | ||
| 995 | |a OCLC offline update by CMU | ||
| 999 | |e z | ||
| 999 | |a cue | ||
| 989 | |d cueme |e - - |f - - |g - |h 0 |i 0 |j 200 |k 240227 |l $0.00 |m |n - - |o - |p 0 |q 0 |t 0 |x 0 |w SpringerLink |1 .i150160392 |u http://ezproxy.coloradomesa.edu/login?url=https://link.springer.com/10.1007/978-0-387-71718-0 |3 SpringerLink |z Click here for access | ||