Littérature scientifique sur le sujet « Just-in-time scheduling »
Créez une référence correcte selon les styles APA, MLA, Chicago, Harvard et plusieurs autres
Sommaire
Consultez les listes thématiques d’articles de revues, de livres, de thèses, de rapports de conférences et d’autres sources académiques sur le sujet « Just-in-time scheduling ».
À côté de chaque source dans la liste de références il y a un bouton « Ajouter à la bibliographie ». Cliquez sur ce bouton, et nous générerons automatiquement la référence bibliographique pour la source choisie selon votre style de citation préféré : APA, MLA, Harvard, Vancouver, Chicago, etc.
Vous pouvez aussi télécharger le texte intégral de la publication scolaire au format pdf et consulter son résumé en ligne lorsque ces informations sont inclues dans les métadonnées.
Articles de revues sur le sujet "Just-in-time scheduling"
Mahavishnu, V. C., A. N. Senthilvel et S. Umamaheswari. « Bee Colony Optimization Solution to Single Machine Just in Time Scheduling Problem ». International Journal of Future Computer and Communication 3, no 6 (décembre 2014) : 400–404. http://dx.doi.org/10.7763/ijfcc.2014.v3.336.
Texte intégralEgbelu, Pius J., et Hsu Pin Wang. « Scheduling for just-in-time manufacturing ». Engineering Costs and Production Economics 16, no 2 (avril 1989) : 117–24. http://dx.doi.org/10.1016/0167-188x(89)90006-2.
Texte intégralMonette, Jean-Noël, Yves Deville et Pascal Van Hentenryck. « Just-In-Time Scheduling with Constraint Programming ». Proceedings of the International Conference on Automated Planning and Scheduling 19 (16 octobre 2009) : 241–48. http://dx.doi.org/10.1609/icaps.v19i1.13356.
Texte intégralVincent, T'kindt. « Multicriteria models for just-in-time scheduling ». International Journal of Production Research 49, no 11 (juin 2011) : 3191–209. http://dx.doi.org/10.1080/00207541003733783.
Texte intégralMcGarry, M. P., M. Reisslein, C. J. Colbourn, M. Maier, F. Aurzada et M. Scheutzow. « Just-in-Time Scheduling for Multichannel EPONs ». Journal of Lightwave Technology 26, no 10 (mai 2008) : 1204–16. http://dx.doi.org/10.1109/jlt.2008.919366.
Texte intégralMüller-Hannemann, Matthias, et Alexander Sonnikow. « Non-approximability of just-in-time scheduling ». Journal of Scheduling 12, no 5 (18 juillet 2009) : 555–62. http://dx.doi.org/10.1007/s10951-009-0120-1.
Texte intégralManoj, U. V., Jatinder N. D. Gupta, Sushil K. Gupta et Chelliah Sriskandarajah. « Supply chain scheduling : Just-in-time environment ». Annals of Operations Research 161, no 1 (1 décembre 2007) : 53–86. http://dx.doi.org/10.1007/s10479-007-0290-1.
Texte intégralSourd, Francis. « Punctuality and idleness in just-in-time scheduling ». European Journal of Operational Research 167, no 3 (décembre 2005) : 739–51. http://dx.doi.org/10.1016/j.ejor.2004.07.018.
Texte intégralShabtay, Dvir. « The just-in-time scheduling problem in a flow-shop scheduling system ». European Journal of Operational Research 216, no 3 (février 2012) : 521–32. http://dx.doi.org/10.1016/j.ejor.2011.07.053.
Texte intégralNAKAMURA, Yutaka, Yoshiaki KOHARA, Keiichi YAMAGATA et Hiroyuki TAMURA. « Rule Based FMS Scheduling for Just-in-Time ». Transactions of the Society of Instrument and Control Engineers 25, no 2 (1989) : 236–42. http://dx.doi.org/10.9746/sicetr1965.25.236.
Texte intégralThèses sur le sujet "Just-in-time scheduling"
BHALGAT, ASHISH ZUMBARLAL. « INSTRUCTION SCHEDULING TO HIDE LOAN/STORE LATENCY IN IRREGULAR ARCHITECTURE EMBEDDED PROCESSORS ». University of Cincinnati / OhioLINK, 2001. http://rave.ohiolink.edu/etdc/view?acc_num=ucin982261963.
Texte intégralBenmansour, Rachid. « Contributions to deterministic and stochastic single machine scheduling in a just-in-time environment considering maintenance activities ». Paris 6, 2011. http://www.theses.fr/2011PA066006.
Texte intégralColin, Emerson Carlos. « Beam Search e inserção de ociosidade no problema de programação de uma máquina em ambiente do tipo JIT ». Universidade de São Paulo, 1997. http://www.teses.usp.br/teses/disponiveis/3/3136/tde-09122003-143854/.
Texte intégralThis work presents some procedures which can be used in production scheduling problems in JIT environments. These procedures may be used in cases of classical production scheduling where the use of the kanban system is infeasible. The case studied is based on a single machine, with multiple due dates, and distinct earliness and tardiness penalties for each job. The objective function is to minimize total cost. A heuristic search procedure known as beam search is used to construct sequences of jobs, and an idleness insertion algorithm is used to obtain schedules. The algorithm used is a generalization of the GAREY et al. (1988) algorithm, where penalties are distinct for earliness and tardiness. The procedure and algorithm are tested in many conditions involving comparisons with dispatching rules and the EXP-ET function. When EXP-ET function is applied with possibility of idleness insertion, the optimal idleness period is provided. It was assumed that problem hardness is dependent on two classical parameters: average tardiness factor and relative range of due dates. Empirical comparative tests are conducted with computational simulation, where computational solution time and objective function value are evaluated. Results indicate that procedures performance is highly dependent on both parameters, showing that is necessary to know parameters values before choosing an appropriate procedure. The detailed results and computational code used in this study are also provided.
Papadopoulou, Theopisti C. « Application of lean scheduling and production control in non-repetitive manufacturing systems using intelligent agent decision support ». Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7377.
Texte intégralFaupel, Titus. « Einsatz von RFID zur Optimierung dezentraler Materialfluss-Steuerung ein Informationssystem zur Flexibilisierung der Reihenfolgeplanung in Kanban ». Freiburg, Br. Rombach, 2009. http://d-nb.info/994852576/04.
Texte intégralFalq, Anne-Elisabeth. « Dominances en programmation linéaire : ordonnancement autour d’une date d’échéance commune ». Electronic Thesis or Diss., Sorbonne université, 2020. http://www.theses.fr/2020SORUS128.
Texte intégralScheduling problems are combinatorial optimization problems arising in project management: the aim is to schedule tasks execution under resource constraints or precedence constraints so as to minimize a cost or maximize a gain. An integer linear programm (ILP° consists in optimizing a linear objective function over the integer points satisfying linear constraints. A lot of operation research problems can be formulated as ILP, and then be solved by commercial ILP. This thesis focuses on a single machine scheduling problem where earliness and tardiness with respect to a common due date have to be minimized. Thanks to so-called dominance properties used in the scheduling field, we propose several ILP formulation for this problem. First formulations, which are based on continuous variables similar to completion times variables (natural variables), use non-overlapping inequalities. Last formulations, which are based on binary partition variables, rely on a new type of linear inequalities that translate dominance properties
Yang, Suh-Jenq, et 楊肅正. « Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System ». Thesis, 2015. http://ndltd.ncl.edu.tw/handle/95842480013291686893.
Texte intégral國立勤益科技大學
流通管理系
103
To cope with intensified global competition and escalating customer demand for superior service, Just-in-time production system has become a competitive strategy for many companies. According to the principle of Just-in-time production system, a company producing orders (or jobs) early, as well as late, is discouraged. This study considers multiple common due-windows assignment and scheduling problems with general position-dependent and resource-dependent processing times simultaneously in a Just-in-time production system. Multiple common due-windows allow a job to fit one from multiple common due-windows. We assume that the number of common due-windows to be assigned to the jobs is given. In this study two resource allocation models are examined, namely the linear resource consumption model and the convex resource consumption model. The actual processing time of a job is a function of its scheduled position in a sequence and its resource allocation. The goal of the study is to determine jointly the optimal common due-window positions and sizes, the set of jobs assigned to each common due-window, the optimal resource allocations, and the optimal schedule for minimizing an objective function which includes earliness, tardiness, common due-windows assignment, makespan, and resource consumption costs. We provide some properties of the optimal schedule for the problem and propose polynomial time algorithms for all the problems considered. We also present two numerical examples to illustrate applying algorithms proposed in the study for understanding the effect of various parameters on the optimal solution. The results of the study can be used in scheduling on distribution management, such as restaurant service, orders picking operation process in a distribution center, or replenishment operations in a hypermarket.
Chen, Ke-Fu, et 陳科甫. « Scheduling of parallel machines to maximize the weighted number of Just-In-Time jobs ». Thesis, 2009. http://ndltd.ncl.edu.tw/handle/98332284841741449559.
Texte intégral中原大學
工業與系統工程研究所
97
We study the problem of non-preemptively scheduling jobs on unrelated parallel machines with the objective to maximize the weighted number of jobs that are completed exactly at their due date. Each job has different arrival time and can only be processed on specified machines. Each machine is not continuously available at all times. Another common assumption is the consideration of sequence-dependent setup times. Setup magnitude of a job depends on its immediately preceding job on the same machine. We propose an optimal algorithm for this problem. We propose a optimal algorithm for this problem. And the computation result will be report.
TANG, CHE-SHENG, et 唐澤生. « Scheduling of maximizing the weighted number of just-in-time jobs using simulated annealing heuristic ». Thesis, 2010. http://ndltd.ncl.edu.tw/handle/83307962668329408304.
Texte intégral中原大學
工業與系統工程研究所
98
We consider the unrelated parallel machines with sequence-dependent setup times problem. The objective is using Simulated Annealing to maximize the weighted number of jobs that are completed exactly at their due date. Each job has different arrival time and can only be processed on specified machines. Each machine is not continuously available at all times. Setup magnitude of a job depends on its immediately preceding job on the same machine. And we compared with Chen (2009) to find the deviation . And the computation result will be report.
Horn, Martin John. « Design and implementation of a prioritised kanban and finite scheduling system to support the JIT philosophy in a medium sized electric motor manufacturer ». Thesis, 2015. http://hdl.handle.net/10539/16893.
Texte intégralLivres sur le sujet "Just-in-time scheduling"
Production planning and scheduling in flexible assembly systems. Berlin : Springer, 1999.
Trouver le texte intégralJózefowska, Joanna, dir. Just-In-Time Scheduling : Models and Algorithms for Computer and Manufacturing Systems. Boston, MA : Springer US, 2007. http://dx.doi.org/10.1007/978-0-387-71718-0.
Texte intégralJIT forecasting and master scheduling : Not an oxymoron. Menlo Park, Calif : Crisp Publications, 1996.
Trouver le texte intégralCorrell, James G. Gaining control : Capacity management and scheduling. 2e éd. New York : John Wiley, 1999.
Trouver le texte intégralW, Edson Norris, dir. Gaining control : Capacity management and scheduling. Essex Junction, VT : O. Wight Ltd. Publications, 1990.
Trouver le texte intégralKrämer, Franz-Josef. Essays in production scheduling with just-in-time related performance measures. 1994.
Trouver le texte intégralJustintime Scheduling Models And Algorithms For Computer And Manufacturing Systems. Springer, 2010.
Trouver le texte intégralLiman, Surya Danusaputro. Scheduling with restricted machine availability and due date. 1991.
Trouver le texte intégralGaining Control : Capacity Management and Scheduling. John Wiley & Sons Inc, 1995.
Trouver le texte intégralJozefowska, Joanna. Just-In-Time Scheduling : Models and Algorithms for Computer and Manufacturing Systems. Springer London, Limited, 2007.
Trouver le texte intégralChapitres de livres sur le sujet "Just-in-time scheduling"
T’kindt, Vincent, et Jean-Charles Billaut. « Single machine Just-in-Time scheduling problems ». Dans Multicriteria Scheduling, 119–45. Berlin, Heidelberg : Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-04986-0_6.
Texte intégralGourvès, Laurent, Jérôme Monnot et Orestis A. Telelis. « Strategic Scheduling Games : Equilibria and Efficiency ». Dans Just-in-Time Systems, 209–44. New York, NY : Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_10.
Texte intégralOulamara, A. « No-Wait Scheduling Problems with Batching Machines ». Dans Just-in-Time Systems, 147–68. New York, NY : Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_7.
Texte intégralSoukhal, Ameur, et Nguyen Huynh Toung. « Just-in-Time Scheduling with Equal-Size Jobs ». Dans Just-in-Time Systems, 107–45. New York, NY : Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_6.
Texte intégralJózefowska, Joanna. « Just-in-Time Scheduling in Modern Mass Production Environment ». Dans Just-in-Time Systems, 171–90. New York, NY : Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_8.
Texte intégralFerrier, Malcolm. « Just-In-Time Project Task Scheduling ». Dans Proceedings of the Future Technologies Conference (FTC) 2018, 959–64. Cham : Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02683-7_70.
Texte intégralTanaka, Shunji. « An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem ». Dans Just-in-Time Systems, 21–40. New York, NY : Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_2.
Texte intégralShabtay, Dvir, et George Steiner. « Scheduling to Maximize the Number of Just-in-Time Jobs : A Survey ». Dans Just-in-Time Systems, 3–20. New York, NY : Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_1.
Texte intégralVallada, Eva, et Rubén Ruiz. « Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization ». Dans Just-in-Time Systems, 67–90. New York, NY : Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_4.
Texte intégralRonconi, Débora P., et Ernesto G. Birgin. « Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness ». Dans Just-in-Time Systems, 91–105. New York, NY : Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_5.
Texte intégralActes de conférences sur le sujet "Just-in-time scheduling"
McGarry, M. P., M. Reisslein, C. J. Colbourn et M. Maier. « Just-in-Time Online Scheduling for WDM EPONs ». Dans 2007 IEEE International Conference on Communications. IEEE, 2007. http://dx.doi.org/10.1109/icc.2007.366.
Texte intégralLlanos, Diego R., David Orden et Belen Palop. « Just-In-Time Scheduling for Loop-based Speculative Parallelization ». Dans 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008). IEEE, 2008. http://dx.doi.org/10.1109/pdp.2008.13.
Texte intégralPolyakovskiy, Sergey, Dhananjay Thiruvady et Rym M'Hallah. « Just-in-time batch scheduling subject to batch size ». Dans GECCO '20 : Genetic and Evolutionary Computation Conference. New York, NY, USA : ACM, 2020. http://dx.doi.org/10.1145/3377930.3390207.
Texte intégralWeng, Wei, et Shigeru Fujimura. « Distributed Feedback Mechanism for Just-In-Time Scheduling Problem ». Dans 2009 Eighth IEEE/ACIS International Conference on Computer and Information Science. IEEE, 2009. http://dx.doi.org/10.1109/icis.2009.12.
Texte intégralShabtay, Dvir, et Miri Gilenson. « The multi-scenario scheduling problem to maximize the weighted number of just-in-time jobs ». Dans The Second International Workshop on Dynamic Scheduling Problems. Polish Mathematical Society, 2018. http://dx.doi.org/10.14708/isbn.978-83-951298-0-3p87-91.
Texte intégralBenmansour, Rachid, Hamid Allaoui et Abdelhakim Artiba. « Single machine scheduling problem in a Just-in-time environment ». Dans 2011 4th International Conference on Logistics (LOGISTIQUA). IEEE, 2011. http://dx.doi.org/10.1109/logistiqua.2011.5939316.
Texte intégralGawiejnowicz, Stanisław, et Nir Halman. « An FPTAS and an SFPTAS for maximizing the weighted number of just-in-time jobs in a proportionate flow shop system ». Dans International Workshop on Dynamic Scheduling Problems. Polish Mathematical Society, 2023. http://dx.doi.org/10.14708/isbn.978-83-962157-1-0p45-51.
Texte intégralDantas, Joana D., et Leonilde R. Varela. « Scheduling single-machine problem based on just-in-time principles ». Dans 2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC). IEEE, 2014. http://dx.doi.org/10.1109/nabic.2014.6921872.
Texte intégralKawamata, Yuka, et Shao-Chin Sung. « On scheduling pseudo just-in-time jobs on single machine ». Dans 2014 26th Chinese Control And Decision Conference (CCDC). IEEE, 2014. http://dx.doi.org/10.1109/ccdc.2014.6852168.
Texte intégralHeulot, Julien, Maxime Pelcat, Jean-Francois Nezan, Yaset Oliva, Slaheddine Aridhi et Shuvra S. Bhattacharyya. « Just-in-time scheduling techniques for multicore signal processing systems ». Dans 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2014. http://dx.doi.org/10.1109/globalsip.2014.7032071.
Texte intégralRapports d'organisations sur le sujet "Just-in-time scheduling"
Green, John G., et Francis J. Miller. Examining the Effects of Precision Scheduled Railroading on Intercity Passenger and High-Speed Rail Service. Mineta Transportation Institute, mars 2022. http://dx.doi.org/10.31979/mti.2022.2016.
Texte intégral