Results 21 to 30 of about 22,096 (146)
An improved constraint satisfaction adaptive neural network for job-shop scheduling [PDF]
, 2007 Copyright @ Springer Science + Business Media, LLC 2009This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems.
B. Giffler +33 more
core +3 more sources
Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling [PDF]
, 2000 Copyright @ 2000 IEEEThis paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems.
Wang, D, Yang, S
core +1 more source
, 2016 Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results.
Boyar, Joan +4 more
core +1 more source
Scheduling under Linear Constraints [PDF]
, 2015 We introduce a parallel machine scheduling problem in which the processing times of jobs are not given in advance but are determined by a system of linear constraints. The objective is to minimize the makespan, i.e., the maximum job completion time among
Nip, Kameng, Wang, Zhenbo, Wang, Zizhuo
core +1 more source
Moderating effects of cross-cultural dimensions on the relationship between persuasive smartphone application's design and acceptance-loyalty [PDF]
, 2018 Applying persuasive system design to different cultures has been a focus of many researchers as the global medium of communication has been centered within Smartphone via applications (apps).
Faisal, Serri
core
A MILP model for an extended version of the Flexible Job Shop Problem [PDF]
, 2014 A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order.
Birgin, Ernesto G. +5 more
core +2 more sources
On‐Time Meal Delivery Assisted by Drone Resupply
Naval Research Logistics (NRL), EarlyView.ABSTRACT Ensuring timely delivery is crucial with the increasing competition in online meal delivery services. This requires the industry to adopt new technologies and the corresponding operational models, including the use of drones. Concerning the desired features of meal delivery, such as safety and reliability, we propose an operational model that ...
Wenqian Liu, Lindong Liu, Xiangtong Qi
wiley +1 more source
A new adaptive neural network and heuristics hybrid approach for job-shop scheduling [PDF]
, 2001 Copyright @ 2001 Elsevier Science LtdA new adaptive neural network and heuristics hybrid approach for job-shop scheduling is presented. The neural network has the property of adapting its connection weights and biases of neural units while solving the ...
Baker +18 more
core +2 more sources
On (1,∊)-Restricted Assignment Makespan Minimization [PDF]
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014 Makespan minimization on unrelated machines is a classic problem in approximation algorithms. No polynomial time $(2- )$-approximation algorithm is known for the problem for constant $ > 0$. This is true even for certain special cases, most notably the restricted assignment problem where each job has the same load on any machine but can be ...
Chakrabarty, Deeparnab +2 more
openaire +1 more source
Scheduling optimization of optical lens polishing
International Transactions in Operational Research, EarlyView.Abstract Optical systems have achieved notable progress in focusing and imaging technologies; however, manual grinding remains indispensable, resulting in elevated costs, extended timelines, and inefficiencies. These difficulties are compounded by operational constraints, uneven machine utilization, and risks of order delays and escalating expenses ...
Tzu‐Chin Lin, Bertrand M. T. Lin
wiley +1 more source