Relevant bibliographies by topics / Just-in-time scheduling

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Just-in-time scheduling'

Author: Grafiati
Published: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Just-in-time scheduling.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Just-in-time scheduling"

1

Mahavishnu, V. C., A. N. Senthilvel, and S. Umamaheswari. "Bee Colony Optimization Solution to Single Machine Just in Time Scheduling Problem." International Journal of Future Computer and Communication 3, no. 6 (2014): 400–404. http://dx.doi.org/10.7763/ijfcc.2014.v3.336.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Egbelu, Pius J., and Hsu Pin Wang. "Scheduling for just-in-time manufacturing." Engineering Costs and Production Economics 16, no. 2 (1989): 117–24. http://dx.doi.org/10.1016/0167-188x(89)90006-2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Monette, Jean-Noël, Yves Deville, and Pascal Van Hentenryck. "Just-In-Time Scheduling with Constraint Programming." Proceedings of the International Conference on Automated Planning and Scheduling 19 (October 16, 2009): 241–48. http://dx.doi.org/10.1609/icaps.v19i1.13356.

Full text
Abstract:
This paper considers Just-In-Time Job-Shop Scheduling, in which each activity has an earliness and a tardiness cost with respect to a due date. It proposes a constraint programming approach, which includes a novel filtering algorithm and dedicated heuristics. The filtering algorithm uses a machine relaxation to produce a lower bound that can be obtained by solving a Just-In-Time Pert problem. It also includes pruning rules which update the variable bounds and detect precedence constraints. The paper presents experimental results which demonstrate the effectiveness of the approach over a wide range of benchmarks.
APA, Harvard, Vancouver, ISO, and other styles
4

Vincent, T'kindt. "Multicriteria models for just-in-time scheduling." International Journal of Production Research 49, no. 11 (2011): 3191–209. http://dx.doi.org/10.1080/00207541003733783.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

McGarry, M. P., M. Reisslein, C. J. Colbourn, M. Maier, F. Aurzada, and M. Scheutzow. "Just-in-Time Scheduling for Multichannel EPONs." Journal of Lightwave Technology 26, no. 10 (2008): 1204–16. http://dx.doi.org/10.1109/jlt.2008.919366.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Müller-Hannemann, Matthias, and Alexander Sonnikow. "Non-approximability of just-in-time scheduling." Journal of Scheduling 12, no. 5 (2009): 555–62. http://dx.doi.org/10.1007/s10951-009-0120-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Manoj, U. V., Jatinder N. D. Gupta, Sushil K. Gupta, and Chelliah Sriskandarajah. "Supply chain scheduling: Just-in-time environment." Annals of Operations Research 161, no. 1 (2007): 53–86. http://dx.doi.org/10.1007/s10479-007-0290-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sourd, Francis. "Punctuality and idleness in just-in-time scheduling." European Journal of Operational Research 167, no. 3 (2005): 739–51. http://dx.doi.org/10.1016/j.ejor.2004.07.018.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Shabtay, Dvir. "The just-in-time scheduling problem in a flow-shop scheduling system." European Journal of Operational Research 216, no. 3 (2012): 521–32. http://dx.doi.org/10.1016/j.ejor.2011.07.053.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

NAKAMURA, Yutaka, Yoshiaki KOHARA, Keiichi YAMAGATA, and 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Just-in-time scheduling"

1

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Benmansour, 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.

Full text
Abstract:
L'ordonnancement est une forme de décision jouant un rôle capital dans les entreprises. Dans un contexte juste à temps (JAT), ces entreprises doivent produire à temps tout en évitant les stocks. Nous considérons ici le problème d’ordonnancement sur une machine avec une date d'échéance commune afin de minimiser le critère avance-retard. Les activités de production et de maintenance vont être prises en compte conjointement. Lorsque la date d'échéance et les durées opératoires sont déterministes et la machine est toujours disponible, nous proposons deux heuristiques pour résoudre ce problème et comparons leurs résultats avec des benchmarks. Ensuite, nous considérons la maintenance préventive comme une contrainte ou comme une variable de décision. Nous fournissons un programme linéaire mixte et un programme dynamique pour résoudre respectivement ces problèmes. Lorsque le coût de la maintenance est rajouté au coût d'avance-retard, une approche de simulation est fournie pour la minimisation du coût total. Enfin, lorsque les durées opératoires des tâches et la date d'échéance sont stochastiques, nous donnons une règle de dominance pour la solution optimale.
APA, Harvard, Vancouver, ISO, and other styles
3

Colin, 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/.

Full text
Abstract:
Este trabalho apresenta procedimentos que podem ser utilizados na programação da produção em um ambiente JIT. Esses procedimentos deveriam ser utilizados em sistemas clássicos de programação, onde a utilização do sistema kanban é inviável. O caso estudado se baseia em uma única máquina, com datas de entrega múltiplas e com penalidades distintas de adiantamento e de atraso para cada ordem. O objetivo a ser alcançado é a minimização do custo total. Para isso, é utilizado um procedimento de busca denominado beam search, para gerar as seqüências, e um algoritmo de inserção de ociosidade, para definir os programas. O algoritmo utilizado é uma generalização do algoritmo de GAREY et al. (1988) onde as penalidades são distintas para adiantamento e para atraso. O procedimento e o algoritmo são testados em várias condições sendo comparados com regras de despacho e com a função EXP-ET. Quando a função EXP-ET é utilizada com a possibilidade de inserção de ociosidade, o período de ociosidade ótimo é determinado. Assume-se que a dificuldade de solução do problema é dependente de dois parâmetros clássicos: fator de atraso médio e amplitude relativa das datas de entrega. Testes empíricos comparativos são realizados através de simulação computacional, onde se mede o tempo de solução e o valor alcançado pela função objetivo. Os resultados indicam que o desempenho dos vários procedimentos testados é altamente dependente dos dois parâmetros, mostrando que para a escolha de um procedimento apropriado, deve-se primeiramente conhecer o valor dos parâmetros. São fornecidos os resultados encontrados e os códigos computacionais utilizados no estudo.<br>This 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.
APA, Harvard, Vancouver, ISO, and other styles
4

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.

Full text
Abstract:
Lean Manufacturing (LM) is widely accepted as a world-class manufacturing paradigm, its currency and superiority are manifested in numerous recent success stories. Most lean tools including Just-in-Time (JIT) were designed for repetitive serial production systems. This resulted in a substantial stream of research which dismissed a priori the suitability of LM for non-repetitive non-serial job-shops. The extension of LM into non-repetitive production systems is opposed on the basis of the sheer complexity of applying JIT pull production control in non-repetitive systems fabricating a high variety of products. However, the application of LM in job-shops is not unexplored. Studies proposing the extension of leanness into non-repetitive production systems have promoted the modification of pull control mechanisms or reconfiguration of job-shops into cellular manufacturing systems. This thesis sought to address the shortcomings of the aforementioned approaches. The contribution of this thesis to knowledge in the field of production and operations management is threefold: Firstly, a Multi-Agent System (MAS) is designed to directly apply pull production control to a good approximation of a real-life job-shop. The scale and complexity of the developed MAS prove that the application of pull production control in non-repetitive manufacturing systems is challenging, perplex and laborious. Secondly, the thesis examines three pull production control mechanisms namely, Kanban, Base Stock and Constant Work-in-Process (CONWIP) which it enhances so as to prevent system deadlocks, an issue largely unaddressed in the relevant literature. Having successfully tested the transferability of pull production control to non-repetitive manufacturing, the third contribution of this thesis is that it uses experimental and empirical data to examine the impact of pull production control on job-shop performance. The thesis identifies issues resulting from the application of pull control in job-shops which have implications for industry practice and concludes by outlining further research that can be undertaken in this direction.
APA, Harvard, Vancouver, ISO, and other styles
5

Faupel, 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Falq, 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.

Full text
Abstract:
Les problèmes d’ordonnancement sont des problèmes d’optimisation combinatoire modélisant la gestion de projets: il s’agit de planifier l’exécution de tâches, sous des contraintes de ressources ou de précédence et de manière à minimiser un coût ou maximiser un gain. On appelle programmation linéaire en nombres entiers (PLNE) l’optimisation d’une fonction linéaire sur les points entiers vérifiant un lot de contraintes linéaires. Cet outil permet de modéliser de nombreux problèmes de recherche opérationnelle, qui peuvent alors être résolus par des solveurs implémentant l’algorithme du simplexe dans un schéma de branchement et évaluation. Cette thèse porte sur l’étude d’un problème d’ordonnancement où les tâches doivent être exécutées sur une machine de manière à minimiser les pénalités d’avance et de retard par rapport à une date de fin souhaitée commune. Grâce à des propriétés dites de dominance utilisées par la communauté de l’ordonnancement, nous avons fourni plusieurs formulations PLNE modélisant ce problème. Les premières formulations, basées sur des variables continues comparables à des dates de fin, dites variables naturelles, utilisent des inégalités de non-chevauchement. Les dernières formulations, basées sur des variables booléennes de partitions, reposent sur un type nouveau d’inégalités linéaires qui traduisant des propriétés de dominance<br>Scheduling 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
APA, Harvard, Vancouver, ISO, and other styles
7

Yang, Suh-Jenq, and 楊肅正. "Scheduling with Multiple Common Due-Windows Assignment in a Just-in-time Production System." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/95842480013291686893.

Full text
Abstract:
碩士<br>國立勤益科技大學<br>流通管理系<br>103<br>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.
APA, Harvard, Vancouver, ISO, and other styles
8

Chen, Ke-Fu, and 陳科甫. "Scheduling of parallel machines to maximize the weighted number of Just-In-Time jobs." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/98332284841741449559.

Full text
Abstract:
碩士<br>中原大學<br>工業與系統工程研究所<br>97<br>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.
APA, Harvard, Vancouver, ISO, and other styles
9

TANG, CHE-SHENG, and 唐澤生. "Scheduling of maximizing the weighted number of just-in-time jobs using simulated annealing heuristic." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/83307962668329408304.

Full text
Abstract:
碩士<br>中原大學<br>工業與系統工程研究所<br>98<br>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.
APA, Harvard, Vancouver, ISO, and other styles
10

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.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Just-in-time scheduling"

1

Production planning and scheduling in flexible assembly systems. Springer, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Józefowska, Joanna, ed. Just-In-Time Scheduling: Models and Algorithms for Computer and Manufacturing Systems. Springer US, 2007. http://dx.doi.org/10.1007/978-0-387-71718-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

JIT forecasting and master scheduling: Not an oxymoron. Crisp Publications, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Correll, James G. Gaining control: Capacity management and scheduling. 2nd ed. John Wiley, 1999.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

W, Edson Norris, ed. Gaining control: Capacity management and scheduling. O. Wight Ltd. Publications, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Krämer, Franz-Josef. Essays in production scheduling with just-in-time related performance measures. 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Justintime Scheduling Models And Algorithms For Computer And Manufacturing Systems. Springer, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liman, Surya Danusaputro. Scheduling with restricted machine availability and due date. 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Gaining Control: Capacity Management and Scheduling. John Wiley & Sons Inc, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Jozefowska, Joanna. Just-In-Time Scheduling: Models and Algorithms for Computer and Manufacturing Systems. Springer London, Limited, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Just-in-time scheduling"

1

T’kindt, Vincent, and Jean-Charles Billaut. "Single machine Just-in-Time scheduling problems." In Multicriteria Scheduling. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-04986-0_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Gourvès, Laurent, Jérôme Monnot, and Orestis A. Telelis. "Strategic Scheduling Games: Equilibria and Efficiency." In Just-in-Time Systems. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Oulamara, A. "No-Wait Scheduling Problems with Batching Machines." In Just-in-Time Systems. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Soukhal, Ameur, and Nguyen Huynh Toung. "Just-in-Time Scheduling with Equal-Size Jobs." In Just-in-Time Systems. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Józefowska, Joanna. "Just-in-Time Scheduling in Modern Mass Production Environment." In Just-in-Time Systems. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ferrier, Malcolm. "Just-In-Time Project Task Scheduling." In Proceedings of the Future Technologies Conference (FTC) 2018. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-030-02683-7_70.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Tanaka, Shunji. "An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem." In Just-in-Time Systems. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Shabtay, Dvir, and George Steiner. "Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey." In Just-in-Time Systems. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vallada, Eva, and Rubén Ruiz. "Scheduling Unrelated Parallel Machines with Sequence Dependent Setup Times and Weighted Earliness–Tardiness Minimization." In Just-in-Time Systems. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ronconi, Débora P., and Ernesto G. Birgin. "Mixed-Integer Programming Models for Flowshop Scheduling Problems Minimizing the Total Earliness and Tardiness." In Just-in-Time Systems. Springer New York, 2011. http://dx.doi.org/10.1007/978-1-4614-1123-9_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Just-in-time scheduling"

1

McGarry, M. P., M. Reisslein, C. J. Colbourn, and M. Maier. "Just-in-Time Online Scheduling for WDM EPONs." In 2007 IEEE International Conference on Communications. IEEE, 2007. http://dx.doi.org/10.1109/icc.2007.366.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Llanos, Diego R., David Orden, and Belen Palop. "Just-In-Time Scheduling for Loop-based Speculative Parallelization." In 16th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP 2008). IEEE, 2008. http://dx.doi.org/10.1109/pdp.2008.13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Polyakovskiy, Sergey, Dhananjay Thiruvady, and Rym M'Hallah. "Just-in-time batch scheduling subject to batch size." In GECCO '20: Genetic and Evolutionary Computation Conference. ACM, 2020. http://dx.doi.org/10.1145/3377930.3390207.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Weng, Wei, and Shigeru Fujimura. "Distributed Feedback Mechanism for Just-In-Time Scheduling Problem." In 2009 Eighth IEEE/ACIS International Conference on Computer and Information Science. IEEE, 2009. http://dx.doi.org/10.1109/icis.2009.12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shabtay, Dvir, and Miri Gilenson. "The multi-scenario scheduling problem to maximize the weighted number of just-in-time jobs." In 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.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Benmansour, Rachid, Hamid Allaoui, and Abdelhakim Artiba. "Single machine scheduling problem in a Just-in-time environment." In 2011 4th International Conference on Logistics (LOGISTIQUA). IEEE, 2011. http://dx.doi.org/10.1109/logistiqua.2011.5939316.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Gawiejnowicz, Stanisław, and Nir Halman. "An FPTAS and an SFPTAS for maximizing the weighted number of just-in-time jobs in a proportionate flow shop system." In International Workshop on Dynamic Scheduling Problems. Polish Mathematical Society, 2023. http://dx.doi.org/10.14708/isbn.978-83-962157-1-0p45-51.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Dantas, Joana D., and Leonilde R. Varela. "Scheduling single-machine problem based on just-in-time principles." In 2014 Sixth World Congress on Nature and Biologically Inspired Computing (NaBIC). IEEE, 2014. http://dx.doi.org/10.1109/nabic.2014.6921872.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kawamata, Yuka, and Shao-Chin Sung. "On scheduling pseudo just-in-time jobs on single machine." In 2014 26th Chinese Control And Decision Conference (CCDC). IEEE, 2014. http://dx.doi.org/10.1109/ccdc.2014.6852168.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Heulot, Julien, Maxime Pelcat, Jean-Francois Nezan, Yaset Oliva, Slaheddine Aridhi, and Shuvra S. Bhattacharyya. "Just-in-time scheduling techniques for multicore signal processing systems." In 2014 IEEE Global Conference on Signal and Information Processing (GlobalSIP). IEEE, 2014. http://dx.doi.org/10.1109/globalsip.2014.7032071.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Just-in-time scheduling"

1

Green, John G., and Francis J. Miller. Examining the Effects of Precision Scheduled Railroading on Intercity Passenger and High-Speed Rail Service. Mineta Transportation Institute, 2022. http://dx.doi.org/10.31979/mti.2022.2016.

Full text
Abstract:
More than just scheduling terminal-to-terminal trips for trains, “Precision Scheduled Railroading” (PSR) creates entire point-to-point trip plans for individual railroad shipments. Since precision execution was first put into practice, the benefits to shipment arrival reliability and to freight railroads’ profitability have been demonstrated by its use in several Class One freight railroads. However, the effects of the PSR operating strategy on passenger railway operations in shared freight/passenger corridors has not been studied in detail. This research examines the effects of PSR railroad operations on passenger railways, including measuring “Host Railroad Minutes of Delay per 10,000 Train-Miles” and “On-Time Performance” of individual passenger railways, both intercity and high-speed.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography