JP2012094136A5 - - Google Patents

Download PDF

Info

Publication number
JP2012094136A5
JP2012094136A5 JP2011227451A JP2011227451A JP2012094136A5 JP 2012094136 A5 JP2012094136 A5 JP 2012094136A5 JP 2011227451 A JP2011227451 A JP 2011227451A JP 2011227451 A JP2011227451 A JP 2011227451A JP 2012094136 A5 JP2012094136 A5 JP 2012094136A5
Authority
JP
Japan
Prior art keywords
lots
lot
allocated
cells
job
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
JP2011227451A
Other languages
Japanese (ja)
Other versions
JP2012094136A (en
JP5759333B2 (en
Filing date
Publication date
Priority claimed from US12/911,766 external-priority patent/US8769542B2/en
Application filed filed Critical
Publication of JP2012094136A publication Critical patent/JP2012094136A/en
Publication of JP2012094136A5 publication Critical patent/JP2012094136A5/ja
Application granted granted Critical
Publication of JP5759333B2 publication Critical patent/JP5759333B2/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Claims (5)

複数のジョブおよび複数のセルのリストを作成することを含み、前記複数のジョブは前記複数のセルの少なくとも一部により生産される予定であり、前記セルのそれぞれは少なくとも１つの生産装置を含み、
前記ジョブを自動分割することを含み、
前記自動分割することが、
前記ジョブをより小さいサイズのロットに分割することと、
前記セルの種々のセルへの前記より小さいサイズのロットを一度に一つのロットずつ割り振ることであって、前記割り振ることは、最早完了経路アルゴリズムを用いて前記セルに前記ジョブの前記より小さいサイズのロットを割り当てることを含み、前記最早完了経路アルゴリズムは、最少のセル間跳躍回数を有する前記複数のジョブの各特定のジョブのための実行可能な経路のセットを列挙し、対応する経路によって識別されるそれらのセルを用いることだけによってベストな割り振りを見つけ、製造処理量と待ち時間との少なくとも１つを考慮して前記特定のジョブを終了させる前記経路及び対応割り振りを選択することを含む、前記割り振ることと、
すべての前記より小さいサイズのロットが割り振られると、より大きなロットを形成するために、前記より小さいサイズのロットのうちのどれを、割り振られた前記より小さいサイズのロットの他のロットと組み合わすことができるかを判断することと、
同じジョブの連続するロットとして組み合わせ可能と判断された前記より小さいサイズのロットをいっしょに統合することと、を含む
セル生産方式環境内の複数のセル全体にわたって作業負荷のバランスをとる方法であって、
前記方法は、少なくとも電子プロセッサの利用により実行される
方法。 Creating a plurality of jobs and a list of cells, wherein the plurality of jobs are to be produced by at least a portion of the plurality of cells, each of the cells comprising at least one production device;
Including automatically dividing the job,
The automatic dividing
Dividing the job into smaller sized lots;
Allocating the smaller sized lots to the various cells of the cell one lot at a time, the allocating using the earliest completion path algorithm to the cell The earliest completion path algorithm enumerates a set of executable paths for each particular job of the plurality of jobs having the least number of inter-cell jumps and is identified by a corresponding path. Selecting the path and corresponding allocation that terminates the particular job taking into account at least one of manufacturing throughput and latency, only by using those cells that Allocation,
Once all the smaller size lots have been allocated, combine any of the smaller size lots with other lots of the allocated smaller size lots to form a larger lot. To determine if you can
Combining the smaller sized lots determined to be combinable as consecutive lots of the same job, and balancing the workload across multiple cells in a cell production environment ,
The method is performed at least by using an electronic processor. 前記自動分割することが、最適ロットサイズを決定するための固定した式を用いずに機能する、請求項１に記載の方法。   The method of claim 1, wherein the automatic partitioning works without using a fixed formula for determining an optimal lot size. 先行して割り振られたロットおよび新しく割り振られたロットが連続しかつ結合されるときには、前記新しく割り振られたロットに対する準備時間を準備時間から差し引く、請求項１に記載の方法。   2. The method of claim 1, wherein when a previously allocated lot and a newly allocated lot are consecutive and combined, a preparation time for the newly allocated lot is subtracted from the preparation time. 前記ロットの２つが連続して割り振られており、かつ同じジョブに属している場合、およびその場合のみ、２つのロットは連続している、請求項３に記載の方法。   The method of claim 3, wherein two lots are consecutive if and only if two of the lots are allocated consecutively and belong to the same job. 前記２つの連続したロットを統合するとき、
前記統合されたロットのサイズは統合中の前記２つのロットのサイズの合計であり、
前記統合されたロットの開始時刻は、より早く開始するように割り振られている前記ロットの開始時刻であり、
前記統合されたロットの終了時刻は、より遅く終了するように割り振られているロットの終了時刻である、請求項４に記載の方法。 When integrating the two consecutive lots,
The size of the integrated lot is the sum of the sizes of the two lots being integrated;
The start time of the integrated lot is the start time of the lot that is allocated to start earlier,
5. The method of claim 4, wherein the end time of the integrated lot is an end time of a lot that is allocated to end later.
JP2011227451A 2010-10-26 2011-10-14 System and method for adaptive lot sizing in cell production systems Expired - Fee Related JP5759333B2 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US12/911,766 US8769542B2 (en) 2010-10-26 2010-10-26 System for adaptive lot sizing in cellular manufacturing for balancing workloads across multiple cells using split-then-merge operations and earliest completion route algorithm
US12/911,766 2010-10-26

Publications (3)

Publication Number Publication Date
JP2012094136A JP2012094136A (en) 2012-05-17
JP2012094136A5 true JP2012094136A5 (en) 2014-11-27
JP5759333B2 JP5759333B2 (en) 2015-08-05

Family

ID=45033708

Family Applications (1)

Application Number Title Priority Date Filing Date
JP2011227451A Expired - Fee Related JP5759333B2 (en) 2010-10-26 2011-10-14 System and method for adaptive lot sizing in cell production systems

Country Status (3)

Country Link
US (1) US8769542B2 (en)
EP (1) EP2447826B1 (en)
JP (1) JP5759333B2 (en)

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8730503B2 (en) 2011-09-19 2014-05-20 Xerox Corporation Methods and systems for balancing job assignments to machines in a production environment
US8792121B2 (en) * 2011-10-20 2014-07-29 Hewlett-Packard Development Company, L.P. Method for controlling printing of a print job
US9111247B2 (en) 2012-09-07 2015-08-18 Palo Alto Research Center Incorporated System and methods for excess capacity in dynamic production systems
JP6395708B2 (en) * 2013-08-09 2018-09-26 株式会社Ｆｕｊｉ Management method and management apparatus for electronic component mounting system having a plurality of production lines
JP2018520910A (en) * 2015-07-03 2018-08-02 オセ−テクノロジーズ・ベー・ヴエーＯｃｅ’−Ｎｅｄｅｒｌａｎｄ Ｂｅｓｌｏｔｅｎ Ｖｅｎｎｏｏｔｓｈａｐ How to control a printing system
CN105183640B (en) * 2015-08-07 2018-06-12 黑龙江大学 Real-time task schedulability test copy analogy method based on linear linked list
CN109890010B (en) * 2017-12-26 2020-09-25 广东电网有限责任公司电力调度控制中心 Inter-cluster balancing method for power communication D2D
JP6958481B2 (en) * 2018-05-25 2021-11-02 京セラドキュメントソリューションズ株式会社 Remote management system and information processing method

Family Cites Families (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4019A (en) * 1845-05-01 Pianoforte
US2016A (en) * 1841-03-26 Mode of constructing fireplaces and chimney-staoks ii
US6007A (en) * 1849-01-09 Improvement in plows
US6434637B1 (en) * 1998-12-31 2002-08-13 Emc Corporation Method and apparatus for balancing workloads among paths in a multi-path computer system based on the state of previous I/O operations
US20050264832A1 (en) 1999-08-31 2005-12-01 Baum Daniel R Printing images in an optimized manner
US6584369B2 (en) * 2000-02-02 2003-06-24 Texas Instruments Incorporated Method and system for dispatching semiconductor lots to manufacturing equipment for fabrication
US6711607B1 (en) 2000-02-04 2004-03-23 Ensim Corporation Dynamic scheduling of task streams in a multiple-resource system to ensure task stream quality of service
US7065567B1 (en) * 2000-11-03 2006-06-20 Xerox Corporation Production server for automated control of production document management
US7079266B1 (en) 2000-11-03 2006-07-18 Xerox Corporation Printshop resource optimization via the use of autonomous cells
US7051328B2 (en) 2001-01-26 2006-05-23 Xerox Corporation Production server architecture and methods for automated control of production document management
AU2003300900A1 (en) * 2002-12-13 2004-07-09 Internap Network Services Corporation Topology aware route control
US6993400B2 (en) 2003-03-07 2006-01-31 Xerox Corporation System and method for real-time assignment of jobs to production cells
US7872767B2 (en) * 2003-04-04 2011-01-18 Xerox Corporation Parallel printing system
US6856845B2 (en) 2003-04-28 2005-02-15 Palo Alto Research Center Inc. Monitoring and reporting incremental job status system and method
US6895292B2 (en) 2003-04-28 2005-05-17 Palo Alto Research Center Inc. Predictive and preemptive planning and scheduling for different job priorities system and method
JP2005062927A (en) * 2003-08-11 2005-03-10 Hitachi Ltd Load control method and device, and processing program therefor
US7904192B2 (en) * 2004-01-14 2011-03-08 Agency For Science, Technology And Research Finite capacity scheduling using job prioritization and machine selection
US8407077B2 (en) 2006-02-28 2013-03-26 Palo Alto Research Center Incorporated System and method for manufacturing system design and shop scheduling using network flow modeling
US7495791B2 (en) * 2004-10-06 2009-02-24 Xerox Corporation Load sharing among networked image processing devices
US8117288B2 (en) * 2004-10-12 2012-02-14 International Business Machines Corporation Optimizing layout of an application on a massively parallel supercomputer
US7873962B2 (en) 2005-04-08 2011-01-18 Xerox Corporation Distributed control systems and methods that selectively activate respective coordinators for respective tasks
JP4724474B2 (en) 2005-06-10 2011-07-13 キヤノン株式会社 Image forming job management apparatus and method, and program
US8477333B2 (en) * 2006-01-27 2013-07-02 Xerox Corporation Printing system and bottleneck obviation through print job sequencing
US7755778B2 (en) 2006-03-30 2010-07-13 Xerox Corporation Print job management system
US8120801B2 (en) 2006-04-25 2012-02-21 Xerox Corporation Print job management system for managing disturbances in a plurality of print jobs
US8259321B2 (en) 2006-04-25 2012-09-04 Xerox Corporation Methods and systems for scheduling disturbance jobs
US7814486B2 (en) 2006-06-20 2010-10-12 Google Inc. Multi-thread runtime system
US8599421B2 (en) * 2006-12-15 2013-12-03 Xerox Corporation Method for managing one or more print processing queues
US7925366B2 (en) 2007-05-29 2011-04-12 Xerox Corporation System and method for real-time system control using precomputed plans
US8028293B2 (en) 2007-06-28 2011-09-27 Microsoft Corporation Optimal policies for load balancing for distributed and strategic agents (more technically, optimal coordination mechanisms for machine scheduling)
US8819694B2 (en) * 2007-12-20 2014-08-26 Samsung Electronics Co., Ltd. System and method for embedded load balancing in a multifunction peripheral (MFP)
US8464268B2 (en) 2009-09-14 2013-06-11 Palo Alto Research Center Incorporated Dynamic scheduling of jobs/batches using earliest completion time algorithm in cellular manufacturing with batch-splitting of jobs above certain size
JP2012068975A (en) * 2010-09-24 2012-04-05 Asahi Glass Co Ltd Management system and management method

Similar Documents

Publication Publication Date Title
JP2012094136A5 (en)
HUE040140T2 (en) Resource assignment for single and multiple cluster transmission
EP2511822A3 (en) Resource management method and computer system
GB2514001B (en) Use of aggregated groups for managing demand response resources
EP2668600A4 (en) Dynamically organizing cloud computing resources to facilitate discovery
BR112012031125A2 (en) methods and systems to allow multiple virtual machines to separately configure and access a physical resource
GB2491362B (en) Dynamic resource allocation for reducing inter-cell interference
GB201412178D0 (en) Low latency variable transfer network for fine grained parallelism of virtual threads across multiple hardward threads
JP2011054161A5 (en)
SG11201509730QA (en) Sharing a virtual hard disk across multiple virtual machines
GB2492653B (en) Simultaneous submission to a multi-producer queue by multiple threads
GB201300798D0 (en) Allocating computer resources in a network data processing system
GB2495456B (en) Accelerator for virtual machine migration
WO2013040463A3 (en) System and method for supporting a server-side event model in a distributed data grid
HK1209561A1 (en) Method to coordinate resource allocation to address inter-cell interference
SG11201404021WA (en) Application-controlled sub-lun level data migration
EP2754046A4 (en) Automatic preemption in multiple computer systems
JP2012214941A5 (en)
MX2016012531A (en) Control area for managing multiple threads in a computer.
JP2012525620A5 (en)
WO2014046975A3 (en) Dynamically allocating network addresses
GB201321869D0 (en) Resource allocation for a plurality of resources for a dual activity system
GB201217077D0 (en) Managing a virtual computer resource
HK1205087A1 (en) Cluster management elevators having a plurality of elevator banks
ZA201404591B (en) Methods and nodes for managing network resources as well as a corresponding system and computer program