Results 241 to 250 of about 3,286,488 (310)

Dynamic-opposite learning enhanced meta-heuristic approach for solving multiple industrial optimization problems. [PDF]

Sci Rep
Wu H, Li L, Wang G, Yang Z, Shi B.
europepmc   +1 more source

Comprehensive retail network dataset for bangladesh: Shop-level sales and location data. [PDF]

Data Brief
Shahin MMH, Swarna JF, Farid DM.
europepmc   +1 more source

Targeting nontuberculous mycobacteria with phages: optimization of in vitro host range assays. [PDF]

BMC Microbiol
Weirauch T, Brügger E, Litzius K, Vehreschild MJGT, Würstle SM, Lieberknecht-Jouy SC.   +5 more
europepmc   +1 more source

The association of household conditions with the development of active pulmonary TB among in households with a previous TB patient: a community-based case-control study. [PDF]

BMC Pulm Med
Prima RR, Geater AF, Djafri D, Chongsuvivatwong V.   +3 more
europepmc   +1 more source

A novel belief-degree-based uncertain Tchebycheff norm DEA model for the case study of risks prioritizing in e-business projects. [PDF]

Sci Rep
Shahbazi M, Rajaei HT, Askarifar K, Mahmoodirad A, Niroomand S.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The no-wait flow shop with rejection

International Journal of Production Research, 2020
We consider the no-wait flow shop scheduling problem with rejection. We first show how to augment the travelling salesman problem formulation for the no-wait flow shop minimum makespan problem to i...
Christos Koulamas, George J. Kyparisis
openaire   +1 more source

On transforming job-shops into flow-shops

Production Planning & Control, 2002
In this paper the problem of transforming a job-shop environment into a flow-shop is addressed, where scheduling issues are simpler and pull production control systems might be easily applied. A linear programming model employing machine investment minimization as objective function is proposed.
Jose M. Framinan, Rafael Ruiz-Usano
openaire   +1 more source

Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops

Journal of Algorithms, 1993
The authors analyse two machine open shop and flow shop scheduling problems. The objective is to minimize the mean job completion time and job preemption is possible. Whereas these two problems on three machines are known to be NP-hard in the strong sense, the complexity status of the two machine problems has been unsolved. In this article, the authors
Jianzhong Du, Joseph Y.-T. Leung
openaire   +1 more source

The no-wait flow-shop paradox

Operations Research Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frits C. R. Spieksma, Gerhard J. Woeginger   +1 more
openaire   +1 more source

Scheduling flow shops with operators

International Journal of Production Research, 2018
This paper addresses the problem of assigning a number of operators, less than the number of machines, in a flow shop environment. We study two different problems. The first is the assignment of operators subject to a fixed job sequence; the second is on handling simultaneously the assignment of operators and the scheduling of jobs on the machines.
Imène Benkalai, Djamal Rebaine, Pierre Baptiste   +2 more
openaire   +2 more sources