Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times.

ABSTRACT: We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a mixed-integer-linear-program model for the problem, and third, to introduce two generalizable tabu-search metaheuristics relying on different neighborhood structures and solution spaces. Computational results for 120 instances (generated from a real case) are reported to empirically demonstrate the effectiveness of the proposed metaheuristics.

SUBMITTER: Krim H

PROVIDER: S-EPMC8929393 | biostudies-literature | 2022

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times.

Krim Hanane H Zufferey Nicolas N Potvin Jean-Yves JY Benmansour Rachid R Duvivier David D

Journal of scheduling 20211017 1

We consider in this work a bicriteria scheduling problem on two different parallel machines with a periodic preventive maintenance policy. The two objectives considered involve minimization of job rejection costs and weighted sum of completion times. They are handled through a lexicographic approach, due to a natural hierarchy among the two objectives in the applications considered. The main contributions of this paper are first to present a new problem relevant to practice, second, to develop a ...[more]

PMID: 35330884

Similar Datasets

A global-local neighborhood search algorithm and tabu search for flexible job shop scheduling problem.

Project description:The Flexible Job Shop Scheduling Problem (FJSP) is a combinatorial problem that continues to be studied extensively due to its practical implications in manufacturing systems and emerging new variants, in order to model and optimize more complex situations that reflect the current needs of the industry better. This work presents a new metaheuristic algorithm called the global-local neighborhood search algorithm (GLNSA), in which the neighborhood concepts of a cellular automaton are used, so that a set of leading solutions called smart-cells generates and shares information that helps to optimize instances of the FJSP. The GLNSA algorithm is accompanied by a tabu search that implements a simplified version of the Nopt1 neighborhood defined in Mastrolilli & Gambardella (2000) to complement the optimization task. The experiments carried out show a satisfactory performance of the proposed algorithm, compared with other results published in recent algorithms, using four benchmark sets and 101 test problems.

| S-EPMC8176541 | biostudies-literature

Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem.

Project description:The solution to the job shop scheduling problem (JSSP) is of great significance for improving resource utilization and production efficiency of enterprises. In this paper, in view of its non-deterministic polynomial properties, a multi-agent genetic algorithm based on tabu search (MAGATS) is proposed to solve JSSPs under makespan constraints. Firstly, a multi-agent genetic algorithm (MAGA) is proposed. During the process, a multi-agent grid environment is constructed based on characteristics of multi-agent systems and genetic algorithm (GA), and a corresponding neighbor interaction operator, a mutation operator based on neighborhood structure and a self-learning operator are designed. Then, combining tabu search algorithm with a MAGA, the algorithm MAGATS are presented. Finally, 43 benchmark instances are tested with the new algorithm. Compared with four other algorithms, the optimization performance of it is analyzed based on obtained test results. Effectiveness of the new algorithm is verified by analysis results.

| S-EPMC6764687 | biostudies-literature

Bi-Objective Flexible Job-Shop Scheduling Problem Considering Energy Consumption under Stochastic Processing Times.

Project description:This paper presents a novel method on the optimization of bi-objective Flexible Job-shop Scheduling Problem (FJSP) under stochastic processing times. The robust counterpart model and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) are used to solve the bi-objective FJSP with consideration of the completion time and the total energy consumption under stochastic processing times. The case study on GM Corporation verifies that the NSGA-II used in this paper is effective and has advantages to solve the proposed model comparing with HPSO and PSO+SA. The idea and method of the paper can be generalized widely in the manufacturing industry, because it can reduce the energy consumption of the energy-intensive manufacturing enterprise with less investment when the new approach is applied in existing systems.

| S-EPMC5131930 | biostudies-literature

Due-window assignment scheduling with variable job processing times.

Project description:We consider a common due-window assignment scheduling problem jobs with variable job processing times on a single machine, where the processing time of a job is a function of its position in a sequence (i.e., learning effect) or its starting time (i.e., deteriorating effect). The problem is to determine the optimal due-windows, and the processing sequence simultaneously to minimize a cost function includes earliness, tardiness, the window location, window size, and weighted number of tardy jobs. We prove that the problem can be solved in polynomial time.

| S-EPMC4396807 | biostudies-other

A DNA algorithm for the job shop scheduling problem based on the Adleman-Lipton model.

Project description:A DNA (DeoxyriboNucleic Acid) algorithm is proposed to solve the job shop scheduling problem. An encoding scheme for the problem is developed and DNA computing operations are proposed for the algorithm. After an initial solution is constructed, all possible solutions are generated. DNA computing operations are then used to find an optimal schedule. The DNA algorithm is proved to have an O(n2) complexity and the length of the final strand of the optimal schedule is within appropriate range. Experiment with 58 benchmark instances show that the proposed DNA algorithm outperforms other comparative heuristics.

| S-EPMC7710087 | biostudies-literature

Minimizing the makespan and carbon emissions in the green flexible job shop scheduling problem with learning effects.

Project description:One of the most difficult challenges for modern manufacturing is reducing carbon emissions. This paper focuses on the green scheduling problem in a flexible job shop system, taking into account energy consumption and worker learning effects. With the objective of simultaneously minimizing the makespan and total carbon emissions, the green flexible job shop scheduling problem (GFJSP) is formulated as a mixed integer linear multiobjective optimization model. Then, the improved multiobjective sparrow search algorithm (IMOSSA) is developed to find the optimal solution. Finally, we conduct computational experiments, including a comparison between IMOSSA and the nondominated sorting genetic algorithm II (NSGA-II), Jaya and the mixed integer linear programming (MILP) solver of CPLEX. The results demonstrate that IMOSSA has high precision, good convergence and excellent performance in solving the GFJSP in low-carbon manufacturing systems.

| S-EPMC10115896 | biostudies-literature

Efficient bounding schemes for the two-center hybrid flow shop scheduling problem with removal times.

Project description:We focus on the two-center hybrid flow shop scheduling problem with identical parallel machines and removal times. The job removal time is the required duration to remove it from a machine after its processing. The objective is to minimize the maximum completion time (makespan). A heuristic and a lower bound are proposed for this NP-Hard problem. These procedures are based on the optimal solution of the parallel machine scheduling problem with release dates and delivery times. The heuristic is composed of two phases. The first one is a constructive phase in which an initial feasible solution is provided, while the second phase is an improvement one. Intensive computational experiments have been conducted to confirm the good performance of the proposed procedures.

| S-EPMC4281465 | biostudies-other

Association of Electronic Self-Scheduling and Screening Mammogram Completion.

Project description:IntroductionThe purpose of this study was to evaluate if an electronic health record (EHR) self-scheduling function was associated with changes in mammogram completion for primary care patients who were eligible for a screening mammogram using U.S. Preventive Service Task Force recommendations.MethodsThis was a retrospective cohort study (September 1, 2014-August 31, 2019, analyses completed in 2022) using a difference-in-differences design to examine mammogram completion before versus after the implementation of self-scheduling. The difference-in-differences estimate was the interaction between time (pre-versus post-implementation) and group (active EHR patient portal versus inactive EHR patient portal). The primary outcome was mammogram completion among all eligible patients, with completion defined as receiving a mammogram within 6 months post-visit. The secondary outcome was mammogram completion among patients who received a clinician order during their visit.ResultsThe primary analysis included 35,257 patient visits. The overall mammogram completion rate in the pre-period was 22.2% and 49.7% in the post-period. EHR self-scheduling was significantly associated with increased mammogram completion among those with an active EHR portal, relative to patients with an inactive portal (adjusted difference 13.2 percentage points [95% CI 10.6-15.8]). For patients who received a clinician mammogram order at their eligible visit, self-scheduling was significantly associated with increased mammogram completion among patients with an active EHR portal account (adjusted difference 14.7 percentage points, [95% CI 10.9-18.5]).ConclusionsEHR-based self-scheduling was associated with a significant increase in mammogram completion among primary care patients. Self-scheduling can be a low-cost, scalable function for increasing preventive cancer screenings.

| S-EPMC10922640 | biostudies-literature

Persistent Periodic Uplink Scheduling Algorithm for Massive NB-IoT Devices.

Project description:Narrowband Internet of Things (NB-IoT) is one of the low-power wide-area network (LPWAN) technologies that aim to support enormous connections, featuring wide-area coverage, low power consumption, and low costs. NB-IoT could serve a massive number of IoT devices, but with very limited radio resources. Therefore, how to enable a massive number of IoT devices to transmit messages periodically, and with low latency, according to transmission requirements, has become the most crucial issue of NB-IoT. Moreover, IoT devices are designed to minimize power consumption so that the device battery can last for a long time. Similarly, the NB-IoT system must configure different power-saving mechanisms for different types of devices to prolong their battery lives. In this study, we propose a persistent periodic uplink scheduling algorithm (PPUSA) to assist a plethora of Internet of Things (IoT) devices in reporting their sensing data based on their sensing characteristics. PPUSA explicitly considers the power-saving mode and connection suspend/resume procedures to reduce the IoT device's power consumption and processing overhead. PPUSA allocates uplink resource units to IoT devices systematically so that it can support the periodic-uplink transmission of a plethora of IoT devices while maintaining low transmission latency for bursty data. The simulation results show that PPUSA can support up to 600,000 IoT devices when the NB-IoT uplink utilization is 80%. In addition, it takes only one millisecond for the transmission of the bursty messages.

| S-EPMC9032283 | biostudies-literature

A scalable photonic computer solving the subset sum problem.

Project description:The subset sum problem (SSP) is a typical nondeterministic-polynomial-time (NP)-complete problem that is hard to solve efficiently in time with conventional computers. Photons have the unique features of high propagation speed, strong robustness, and low detectable energy level and therefore can be promising candidates to meet the challenge. Here, we present a scalable chip built-in photonic computer to efficiently solve the SSP. We map the problem into a three-dimensional waveguide network through a femtosecond laser direct writing technique. We show that the photons sufficiently dissipate into the networks and search for solutions in parallel. In the case of successive primes, our approach exhibits a dominant superiority in time consumption even compared with supercomputers. Our results confirm the ability of light to realize computations intractable for conventional computers, and suggest the SSP as a good benchmarking platform for the race between photonic and conventional computers on the way toward "photonic supremacy."

| S-EPMC6994215 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data