Single machine scheduling
637 resources related to Single machine scheduling
- Topics related to Single machine scheduling
- IEEE Organizations related to Single machine scheduling
- Conferences related to Single machine scheduling
- Periodicals related to Single machine scheduling
- Most published Xplore authors for Single machine scheduling
The 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2020) will be held in Metro Toronto Convention Centre (MTCC), Toronto, Ontario, Canada. SMC 2020 is the flagship conference of the IEEE Systems, Man, and Cybernetics Society. It provides an international forum for researchers and practitioners to report most recent innovations and developments, summarize state-of-the-art, and exchange ideas and advances in all aspects of systems science and engineering, human machine systems, and cybernetics. Advances in these fields have increasing importance in the creation of intelligent environments involving technologies interacting with humans to provide an enriching experience and thereby improve quality of life. Papers related to the conference theme are solicited, including theories, methodologies, and emerging applications. Contributions to theory and practice, including but not limited to the following technical areas, are invited.
IECON is focusing on industrial and manufacturing theory and applications of electronics, controls, communications, instrumentation and computational intelligence.
ICST 2019 is intended to provide a common forum for researchers, scientists, engineers and practitioners throughout the world to present their latest research findings, ideas, developments and applications in the area of Software Testing, Verification and Validation. Topics of interest include, but are not limited to:Testing theory and practice, Testing in globally-distributed organizations, Model-based testing, Model-driven engineering and testing, Domain specific testing, Quality assurance, Model checking, Formal verification, Fuzzing, Inspections, Testing and analysis tools, Design for testability, Testing education, Technology transfer in testing, Testing of open source, etc. Besides research track papers, the conference also include doctoral forum, software testing contest and various workshops.
Promote the exchange of ideas between academia and industry in the field of computer and networks dependability
The conference is the primary forum for cross-industry and multidisciplinary research in automation. Its goal is to provide a broad coverage and dissemination of foundational research in automation among researchers, academics, and practitioners.
The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...
The IEEE Transactions on Automation Sciences and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. We welcome results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, ...
Rigorously peer-reviewed forum for publishing early, high-impact results in the areas of uni- and multiprocessors computer systems, computer architecture workload characterization, performance evaluation and simulation techniques, and power-aware computing
Methods, algorithms, and human-machine interfaces for physical and logical design, including: planning, synthesis, partitioning, modeling, simulation, layout, verification, testing, and documentation of integrated-circuit and systems designs of all complexities. Practical applications of aids resulting in producible analog, digital, optical, or microwave integrated circuits are emphasized.
Design and analysis of algorithms, computer systems, and digital networks; methods for specifying, measuring, and modeling the performance of computers and computer systems; design of computer components, such as arithmetic units, data storage devices, and interface devices; design of reliable and testable digital devices and systems; computer networks and distributed computer systems; new computer organizations and architectures; applications of VLSI ...
2nd IEEE International Conference on Industrial Informatics, 2004. INDIN '04. 2004, 2004
An application of a new hybrid optimization approach for the single-machine total weighted tardiness problem (SMTWTP) is presented in this article. SMTWTP is known Io be NP-hard, and thus the right way to proceed is through the use of heuristic techniques. The proposed approach combines the stochastic sampling of a simulated annealing algorithm (SAA) together with features borrowed from the ...
2008 7th World Congress on Intelligent Control and Automation, 2008
In this paper, a class of single machine resource constrained scheduling problem is investigated. In this model, it is assumed that the jobs are subject to parallel chains precedence constrains. The objective is total weighted completion times. Two versions of problem are addressed. In the first one the chains canpsilat be interrupted, whereas in the second one the chains can ...
2017 First International Conference on Electronics Instrumentation & Information Systems (EIIS), 2017
Scheduling jobs on parallel machines to minimize total tardiness (P//T) plays an important role in real applications. The problem of P//T has been proved to be NP-hard, and the complexity of computation increases heavily with the growing of the number of machines. First, a graphical model to describe P//T is constructed in this paper, so that ACO (Ant Colony Optimization) ...
Journal of Systems Engineering and Electronics, 2009
The problem of minimizing the maximum lateness on a single machine with family setups is considered. To solve the problem, dominance property is studied and then introduced into the tabu search (TS) algorithm. With the dominance property, most unpromising neighbors can be excluded from the neighborhood, which makes the search process always focus on the most promising areas of the ...
2001 International Conferences on Info-Tech and Info-Net. Proceedings (Cat. No.01EX479), 2001
In the paper the interval perturbation robustness of an optimal schedule is defined. In Li Jiangeng and Tu Fengsheng (2001) some methods are given by which the interval perturbation robustness of an optimal schedule can be determined for some scheduling problems. In this paper some new methods to judge the interval perturbation robustness of an optimal schedule are given. These ...
Digital Neuromorphic Design of a Liquid State Machine for Real-Time Processing - Nicholas Soures: 2016 International Conference on Rebooting Computing
ICASSP 2010 - Advances in Neural Engineering
Towards Higher Scalability of Quantum Hardware Emulation - Naveed Mahmud - ICRC 2018
An IEEE IPC Special Session with X. Chen from Nokia Bell Labs
Energy Efficient Single Flux Quantum Based Neuromorphic Computing - IEEE Rebooting Computing 2017
Single Frame Super Resolution: Fuzzy Rule-Based and Gaussian Mixture Regression Approaches
A Comparison Between Single Purpose and Flexible Neuromorphic Processor Designs: IEEE Rebooting Computing 2017
Machine Learning of Motor Skills for Robotics
Broadband IQ, Image Reject, and Single Sideband Mixers: MicroApps 2015 - Marki Microwave
IMS MicroApps: Single Chip LNA on 0.25um SOS for SKA Midband Receiver
Single Die Broadband CMOS Power Amplifier and Tracker with 37% Overall Efficiency for TDD/FDD LTE Applications: RFIC Industry Forum
Linear Regression: Intro to Machine Learning Workshop - IEEE Region 4 Presentation
A Wideband Single-PLL RF Receiver for Simultaneous Multi-Band and Multi-Channel Digital Car Radio Reception: RFIC Industry Showcase
Maker Faire 2008: Spectrum's Digital Clock Contest Winner
IEEE Day Future Milestone: Machine Learning in the future
Some Recent Work in Computational Intelligence for Software Engineering
Signal Processing and Machine Learning
Nanophotonic Devices for Quantum Information Processing: Optical Computing - Carsten Schuck at INC 2019
Multiobjective Quantum-inspired Evolutionary Algorithm and Preference-based Solution Selection Algorithm
An application of a new hybrid optimization approach for the single-machine total weighted tardiness problem (SMTWTP) is presented in this article. SMTWTP is known Io be NP-hard, and thus the right way to proceed is through the use of heuristic techniques. The proposed approach combines the stochastic sampling of a simulated annealing algorithm (SAA) together with features borrowed from the field of evolutionary algorithms, such as the population of individual solutions and a special unary recombination operator. The performance of the hybrid SSA is tested over multiple benchmark problems with up to 50 jobs on a single machine and compared to that of other previously studied heuristics. The results obtained are in average less than 1% above the known global optimum solutions
In this paper, a class of single machine resource constrained scheduling problem is investigated. In this model, it is assumed that the jobs are subject to parallel chains precedence constrains. The objective is total weighted completion times. Two versions of problem are addressed. In the first one the chains canpsilat be interrupted, whereas in the second one the chains can be interrupted. For both cases, polynomial algorithms are presented, respectively. We also give an example to illustrate the feasibility of the algorithm.
Scheduling jobs on parallel machines to minimize total tardiness (P//T) plays an important role in real applications. The problem of P//T has been proved to be NP-hard, and the complexity of computation increases heavily with the growing of the number of machines. First, a graphical model to describe P//T is constructed in this paper, so that ACO (Ant Colony Optimization) can be applied to resolve the problem. Secondly, a modified ACO algorithm is developed in which some new computation rules are developed to improve the efficiency. Finally, data experiments are processed, which demonstrates that the approaches proposed in this paper can achieve comparable results to some currently popular algorithms.
The problem of minimizing the maximum lateness on a single machine with family setups is considered. To solve the problem, dominance property is studied and then introduced into the tabu search (TS) algorithm. With the dominance property, most unpromising neighbors can be excluded from the neighborhood, which makes the search process always focus on the most promising areas of the solution space. The proposed algorithms are tested both on the randomly generated problems and on the real-life problems. Computational results show that the proposed TS algorithm outperforms the best existing algorithm and can solve the real-life problems in about 1.3 on average.
In the paper the interval perturbation robustness of an optimal schedule is defined. In Li Jiangeng and Tu Fengsheng (2001) some methods are given by which the interval perturbation robustness of an optimal schedule can be determined for some scheduling problems. In this paper some new methods to judge the interval perturbation robustness of an optimal schedule are given. These are: two if and only if conditions for a single machine total weighted completion time problem, some if conditions for a single machine total weighted completion time problem with precedence constraints which take the form of chains, some if conditions for a single machine maximum lateness problem with precedence constraints which take any form, some if conditions for a single machine tardy jobs problem, and some if conditions for a two machine job shop problem with the objective of maximum completion time.
Single machine scheduling is of essential importance due to its practical applications and the fact that it reduces bottleneck in production lines and provides results that are useful for more complex scheduling environments. In this article, Single machine scheduling problem to minimize the number of tardy jobs and maximum earliness and no slack time is examined. The reason of applying these two criteria simultaneously is the tendency to use the JIT system that finds earlier or later production undesirable. In this study, a genetic algorithm has been proposed to solve the problem. A set of instance problems have been investigated and the results are compared with the results of genetic algorithm used in the research literature. Numerical experiments show better performance of proposed algorithm.
Genetic algorithms have been applied to the scheduling of job shops-a class of very complicated combinatorial optimization problems. Among these algorithms for job shops, a common assumption is that the routes that jobs visit machines are fixed, this is not true for flexible job shops such as flexible manufacturing systems, where jobs have machine route flexibility. The paper presents a new genetic algorithm to solve the flexible job-shop scheduling problem with makespan criterion. The representation of solutions for the problem by chromosomes consists of two parts. The first part defines the routing policy and the second part the sequence of the operations on each machine. Genetic operators are introduced and used in the reproduction process of the algorithm. Numerical experiments show that our algorithm can find out high-quality schedules.
The authors recently suggested a new approach to the design of fuzzy control rules. The method, referred to as fuzzy Lyapunov synthesis, extends classical Lyapunov synthesis to the domain of "computing with words", and allows the systematic, instead of heuristic, design and analysis of fuzzy controllers given linguistic information about the plant. In this paper we use the fuzzy Lyapunov synthesis method to design and analyze the rule-base of a fuzzy scheduler. We show that fuzzy rules, previously suggested based on heuristics, can be derived systematically and, therefore, that the entire process can be automated. This may lead to a novel "computing with words" algorithm: the input is linguistic information concerning the "plant" and the "control" objective, and the output is a suitable fuzzy rule-base.
Focusing upon job sequencing in fuzzy production environment, the fuzzy scheduling model and its algorithm are proposed for unrelated parallel machines in this study. Considering uncertain jobs' processing times and due dates, in light of the possibility and necessity measures in fuzzy theory, the tardiness credibility index of job is proposed to estimate the possibility of job's tardiness. The mixed integer programming model of unrelated parallel machines is constructed for average credibility of job's tardiness. A novel hybrid fuzzy genetic algorithm is developed to tackle the model. Finally, a case study is given to demonstrate the effectiveness of the proposed algorithm.
We introduce a two-level heuristic approach for solving jobs originated from incompatible job families that aims to minimize the total weighted tardiness. At the first level, an apparent tardiness cost with setups (ATCS) for a single machine is developed. The second level, a tabu search (TS) heuristic is developed that uses the initial solution obtained by the ATCS and provides a better solution if it exist. Real industrial data is used to test and validate the proposed methodology. The results indicate that the suggested approach can provide solution in a reasonable good time that can be of use for the decision maker.
No standards are currently tagged "Single machine scheduling"