Results 151 to 160 of about 4,945,017 (242)
Some of the next articles are maybe not open access.
IEEE transactions on engineering management, 2021
Nowadays, many manufacturing and service industries prefer to share resources such as facilities and workers to cooperatively perform tasks, which can efficiently improve resource utilization and customer satisfaction. Generally, the decision-makers need
Yaping Fu +3 more
semanticscholar +1 more source
Nowadays, many manufacturing and service industries prefer to share resources such as facilities and workers to cooperatively perform tasks, which can efficiently improve resource utilization and customer satisfaction. Generally, the decision-makers need
Yaping Fu +3 more
semanticscholar +1 more source
Engineering optimization (Print), 2021
This article presents a new variant for the open shop scheduling problem, the open shop scheduling problem with repetitions (OSSPR), where the jobs can be processed on any machine more than once (operation by operation).
Levi Ribeiro de Abreu +4 more
semanticscholar +1 more source
This article presents a new variant for the open shop scheduling problem, the open shop scheduling problem with repetitions (OSSPR), where the jobs can be processed on any machine more than once (operation by operation).
Levi Ribeiro de Abreu +4 more
semanticscholar +1 more source
Solving Open Shop Scheduling Problem via Graph Attention Neural Network
IEEE International Conference on Tools with Artificial Intelligence, 2020Open Shop Scheduling Problem (OSSP) minimizing makespan has attracted attention increasingly. Complex constraints and large solution space cause great difficulty for acquiring optimal solutions.
Jing Li +3 more
semanticscholar +1 more source
Social Science Research Network, 2020
An open-shop scheduling problem to minimize the total weighted earliness-tardiness of job-on-machine operations is studied. Each operation has its own due date, earliness weight and tardiness weight. An efficient relax-and-solve heuristic is developed. A
M. Ahmadian, A. Salehipour, M. Kovalyov
semanticscholar +1 more source
An open-shop scheduling problem to minimize the total weighted earliness-tardiness of job-on-machine operations is studied. Each operation has its own due date, earliness weight and tardiness weight. An efficient relax-and-solve heuristic is developed. A
M. Ahmadian, A. Salehipour, M. Kovalyov
semanticscholar +1 more source
IEEE Transactions on Systems, Man, and Cybernetics: Systems
Recently, energy conservation in manufacturing industry, particular in energy-intensive industries, receives much attention in order to meet the environmental protection and sustainable development needs.
Yaping Fu +5 more
semanticscholar +1 more source
Recently, energy conservation in manufacturing industry, particular in energy-intensive industries, receives much attention in order to meet the environmental protection and sustainable development needs.
Yaping Fu +5 more
semanticscholar +1 more source
IISE Transactions, 2019
An Integrated Practice Unit (IPU) is a new approach to outpatient care in which a co-located multidisciplinary team of clinicians, technicians, and staff provide treatment in a single patient visit.
Pengfei Zhang +3 more
semanticscholar +1 more source
An Integrated Practice Unit (IPU) is a new approach to outpatient care in which a co-located multidisciplinary team of clinicians, technicians, and staff provide treatment in a single patient visit.
Pengfei Zhang +3 more
semanticscholar +1 more source
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.
Liu, C. Y., Bulfin, R. L.
openaire +2 more sources
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.
Liu, C. Y., Bulfin, R. L.
openaire +2 more sources
2019
The formulation of an open shop scheduling problem is the same as for the flow shop problem except that the order of processing tasks comprising one job may be arbitrary.
Jacek Blazewicz +5 more
openaire +1 more source
The formulation of an open shop scheduling problem is the same as for the flow shop problem except that the order of processing tasks comprising one job may be arbitrary.
Jacek Blazewicz +5 more
openaire +1 more source
2022
Workers resisted precarity by attempting to make Miami a union town. Unionization efforts largely succeeded in the construction sector and other skilled trades. This organizing expanded during WWI to include such areas as street-car operation and retail work.
openaire +1 more source
Workers resisted precarity by attempting to make Miami a union town. Unionization efforts largely succeeded in the construction sector and other skilled trades. This organizing expanded during WWI to include such areas as street-car operation and retail work.
openaire +1 more source
Petri Nets and Deadlock-Free Scheduling of Open Shop Manufacturing Systems
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2018In this paper, we study the open shop scheduling problem with blocking and deadlocks. First, we develop a new Petri net class that extends the well-known $\text{S}^{3}\text{R}$ nets to handle the features of open shop systems.
G. Mejía +2 more
semanticscholar +1 more source