Results 251 to 260 of about 489,185 (305)

Concurrent availability of cannabinoid and tobacco products in licensed tobacco retailers in three U.S. cities. [PDF]

Int J Drug Policy
Spillane TE, Cohen JE, Spindle TR, Thrul J, Moran M, Lee HM, Giovenco DP.   +6 more
europepmc   +1 more source

Accuracy of Medicare Information Provided by State Health Insurance Assistance Programs.

JAMA Netw Open
Dugan K, Peterson I, Dorneo A, Garrido MM.   +3 more
europepmc   +1 more source

Identifying Online Only Delivery Food Outlets in the North of England Using Data from Food Delivery Apps

Groves H, Clarkson D, Boyland E, Shaw N, Lake AA, Bradford C, Chang M, Townshend T, Lloyd S, Tindall E, O’Malley C, Moore HJ, Brown H.   +12 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Open shops with jobs overlap––revisited

European Journal of Operational Research, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joseph Y-T Leung, Michael Pinedo, Chelliah Sriskandarajah   +2 more
exaly   +3 more sources

Scheduling open shops with parallel machines

Operations Research Letters, 1982
The parallel shop and the open shop are two machine environments that have received much attention in the literature of scheduling theory. A common generalization-the open shop with parallel machines-is considered in this paper. Polynomial-time algorithms are presented for obtaining minimum-length preemptive schedules for three cases.
E L Lawler
exaly   +2 more sources

On the complexity of proportionate open shop and job shop problems

Optimization Letters, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abdennour Azerine, Mourad Boudhar, Djamal Rebaine   +2 more
openaire   +2 more sources

Open shop cyclic scheduling

European Journal of Operational Research, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jaroslaw Pempera, Czeslaw Smutnicki
openaire   +1 more source

Scheduling ordered open shops

Computers & Operations Research, 1987
This paper examines special cases of the open shop problem in an attempt to define the boundary between easy and apparently hard, i.e. NP- complete, problems. The top result is: the minimizing makespan in an ordered three-machine open shop is NP-complete. This implies that many other open shop problems are also NP-complete.
Chang-yung Liu, Robert L. Bulfin Jr.
openaire   +2 more sources

An Algorithm for the Open-Shop Problem

Mathematics of Operations Research, 1983
The open-shop problem is known to be NP-complete. However we give an algorithm, which solves the problem in polynomial time, whenever the sum of execution times for one processor is large enough with respect to the maximal execution time. According to the schedule given by our algorithm one of the processors works without idle time.
openaire   +1 more source

Routing open shop and flow shop scheduling problems

European Journal of Operational Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wei Yu 0011, Zhaohui Liu 0001, Leiyang Wang, Tijun Fan   +3 more
openaire   +2 more sources