Results 81 to 90 of about 6,554,898 (191)
, 2000 In this thesis, we study neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems.
Congram, Richard K., Congram, R.K.
core +1 more source
MINIMIZING TOTAL TARDINESS IN PERMUTATION FLOWSHOPS
, 1995 We consider the permutation flowshop scheduling problem with the objective of minimizing total tardiness. Presented are several properties that are used to calculate lower bounds on total tardiness of jobs for a given partial sequence and to identify ...
Kim, Yeong-Dae
core +1 more source
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2014 We propose an efficient heuristic method for job-shop scheduling problems (JSP) with the objective of total weighted tardiness minimization. The proposed method uses schedule reconstructions by priority rules to guide a local search towards promising ...
Soichiro YOKOYAMA +2 more
doaj +1 more source
Which Thoughts Require Sensory Capacities?
Philosophy and Phenomenological Research, EarlyView.ABSTRACT Is it possible that something—say, an alien, an angel, or an artificial system—thinks without having or ever having had any sensory capacity? If so, what could such a thing think? An extreme nativist view on this issue is that it's possible to think every thought—alternatively, every thinkable thought—without having or having had any sensory ...
Pär Sundström
wiley +1 more source
Deep Q-Networks for Minimizing Total Tardiness on a Single Machine
MathematicsThis paper considers the single-machine scheduling problem of total tardiness minimization. Due to its computational intractability, exact approaches such as dynamic programming algorithms and branch-and-bound algorithms struggle to produce optimal ...
Kuan Wei Huang, Bertrand M. T. Lin
doaj +1 more source
Improved Lower Bounds for the Early/Tardy Scheduling Problem with No Idle Time [PDF]
In this paper we consider the single machine earliness/tardiness scheduling problem with no idle time. Two of the lower bounds previously developed for this problem are based on lagrangean relaxation and the multiplier adjustment method, and require an ...
Rui A. F. S. Alves, Jorge M. S. Valente
core
TESOL Journal, Volume 17, Issue 4, December 2026.ABSTRACT Although the Philippines is gaining growing recognition as an effective site for English learning, especially among Japanese and Korean students, critical attention must be paid to the instrumentalization of Filipino instructors and the country, and the racialized discourse and practice.
Aika Ishige
wiley +1 more source
Heuristics for the Early/Tardy Scheduling Problem with Release Dates [PDF]
In this paper we consider the single machine earliness/tardiness scheduling problem with di?erent release dates and no unforced idle time. We analyse the performance of several dispatch rules, a greedy procedure and a decision theory local search ...
Rui A. F. S. Alves, Jorge M. S. Valente
core
New Instances for the Single Machine Total Weighted Tardiness Problem
, 2010 Previous research in the single machine total weighted tardiness problem (SMTWTP) has led to the proposition of effective local search strategies. At least existing benchmark instances from the literature do not pose a challenge for state-of-the-art ...
Geiger, Martin Josef
core +1 more source
ENERGY &ENVIRONMENTAL MATERIALS, Volume 9, Issue 6, November 2026.This study investigates Spanish broom (Spartium junceum) as a renewable source for electrospun composite membranes in sustainable water purification. MCC and biochar were functionalized with eco‐friendly precursors and nanomaterials (i.e., HNT, β‐CDs) to develop hybrid PVA nanofiber composites.
Giulia Rando +7 more
wiley +1 more source