Search results for "Makespan"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
24	Tobias Brüggemann, Johann L. Hurink, Tjark Vredeveld, Gerhard J. Woeginger	Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines.	WAOA	2007	DBLP DOI BibTeX RDF
24	Yuzhong Zhang, Zhigang Cao	An Asymptotic PTAS for Batch Scheduling with Nonidentical Job Sizes to Minimize Makespan.	COCOA	2007	DBLP DOI BibTeX RDF
24	Mohamed Maiza, Hamid Hentous, Abdenour Labed	An Efficient Heuristic for Scheduling a Flowshop to Minimize the Makespan Criterion.	ISCC	2006	DBLP DOI BibTeX RDF	extended flow, Scheduling, Branch and bound, marking, flow-shop
24	Ali Husseinzadeh Kashan, Behrooz Karimi, Fariborz Jolai	Minimizing Makespan on a Single Batch Processing Machine with Non-identical Job Sizes: A Hybrid Genetic Approach.	EvoCOP	2006	DBLP DOI BibTeX RDF
24	Ashish M. Mehta, Jay Smith, Howard Jay Siegel, Anthony A. Maciejewski, Arun Jayaseelan, Bin Ye	Dynamic Resource Management Heuristics for Minimizing Makespan while Maintaining an Acceptable Level of Robustness in an Uncertain Environment.	ICPADS (1)	2006	DBLP DOI BibTeX RDF
24	David P. Bunde	Power-aware scheduling for makespan and flow.	SPAA	2006	DBLP DOI BibTeX RDF	low power, dynamic voltage scaling, power-aware scheduling, speed scaling
24	Derya Eren Akyol, Gunhan Mirac Bayhan	Minimizing Makespan on Identical Parallel Machines Using Neural Networks.	ICONIP (3)	2006	DBLP DOI BibTeX RDF
24	Michael G. Madden, Roberta Wyrick, Dale E. O'Neill	A strategy for autogeneration of space shuttle ground processing simulation models for project makespan estimation.	WSC	2005	DBLP DOI BibTeX RDF
24	K. Rameshkumar, R. K. Suresh, K. M. Mohanasundaram	Discrete Particle Swarm Optimization (DPSO) Algorithm for Permutation Flowshop Scheduling to Minimize Makespan.	ICNC (3)	2005	DBLP DOI BibTeX RDF
24	Antonio Frangioni, Emiliano Necciari, Maria Grazia Scutellà	A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems.	J. Comb. Optim.	2004	DBLP DOI BibTeX RDF	production/scheduling, approximations/heuristic: multi-exchange neighborhood, networks/graphs, flow algorithms: disjoint cycle computation
24	Hadas Shachnai, Tami Tamir, Gerhard J. Woeginger	Minimizing Makespan and Preemption Costs on a System of Uniform Machines.	ESA	2002	DBLP DOI BibTeX RDF
24	Clint Hepner, Clifford Stein 0001	Minimizing Makespan for the Lazy Bureaucrat Problem.	SWAT	2002	DBLP DOI BibTeX RDF
24	Ruy Luiz Milidiú, Artur Alves Pessoa, Eduardo Sany Laber	Complexity of Makespan Minimization for Pipeline Transportation of Petroleum Products.	APPROX	2002	DBLP DOI BibTeX RDF
24	Chandra Chekuri, Michael A. Bender	An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines.	IPCO	1998	DBLP DOI BibTeX RDF
24	Yiqun Ge, David Y. Y. Yun	Simultaneous Compression of Makespan and Number of Processors Using CRP.	IPPS	1996	DBLP DOI BibTeX RDF	2D Compression, Constrained Resource Planning, Dependency, Resource Management, Granularity, Multiprocessor Scheduling, Completion Time, Inherent Parallelism, Parallel Programming Tool
18	Samee Ullah Khan, Ishfaq Ahmad	A Cooperative Game Theoretical Technique for Joint Optimization of Energy Consumption and Response Time in Computational Grids.	IEEE Trans. Parallel Distributed Syst.	2009	DBLP DOI BibTeX RDF
18	V. S. Anil Kumar 0001, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan	A unified approach to scheduling on unrelated parallel machines.	J. ACM	2009	DBLP DOI BibTeX RDF	scheduling under multiple criteria, Approximation algorithms, randomized rounding
18	Tomoaki Hamano, Toshio Endo, Satoshi Matsuoka	Power-aware dynamic task scheduling for heterogeneous accelerated clusters.	IPDPS	2009	DBLP DOI BibTeX RDF
18	Bo Zhang 0016, Binoy Ravindran	Brief Announcement: Relay: A Cache-Coherence Protocol for Distributed Transactional Memory.	OPODIS	2009	DBLP DOI BibTeX RDF
18	Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram	A Survey on Approximation Algorithms for Scheduling with Machine Unavailability.	Algorithmics of Large and Complex Networks	2009	DBLP DOI BibTeX RDF
18	José R. Correa, Martin Skutella, José Verschae	The Power of Preemption on Unrelated Machines and Applications to Scheduling Orders.	APPROX-RANDOM	2009	DBLP DOI BibTeX RDF
18	Enrico Giunchiglia, Marco Maratea	Improving Plan Quality in SAT-Based Planning.	AI*IA	2009	DBLP DOI BibTeX RDF
18	Viswanath Nagarajan, Maxim Sviridenko	Tight Bounds for Permutation Flow Shop Scheduling.	IPCO	2008	DBLP DOI BibTeX RDF
18	Ioannis Caragiannis	Better bounds for online load balancing on unrelated machines.	SODA	2008	DBLP BibTeX RDF
18	Yuanqiang Huang, Depei Qian, Zhongzhi Luan, Yongjian Wang, Zhongxin Wu, Bingheng Yan	EOMT: A Master-Slave Task Scheduling Strategy for Grid Environment.	HPCC	2008	DBLP DOI BibTeX RDF
18	Katia Leal, Eduardo Huedo, Ignacio Martín Llorente	Dynamic Objective and Advance Scheduling in Federated Grids.	OTM Conferences (1)	2008	DBLP DOI BibTeX RDF	Federated Grids, Scheduling, Planning, Independent Tasks
18	Hongyang Sun 0001, Wen-Jing Hsu	Adaptive B-Greedy (ABG): A simple yet efficient scheduling algorithm.	IPDPS	2008	DBLP DOI BibTeX RDF
18	Fatos Xhafa, Javier Carretero, Enrique Alba 0001, Bernabé Dorronsoro	Design and evaluation of tabu search method for job scheduling in distributed environments.	IPDPS	2008	DBLP DOI BibTeX RDF
18	Irena Bach, Grzegorz Bocewicz, Zbigniew Antoni Banaszak	Constraint Programming Approach to Time-Window and Multiresource-Constrained Projects Portfolio Prototyping.	IEA/AIE	2008	DBLP DOI BibTeX RDF	decision making, knowledge engineering, constraint programming, project scheduling
18	Brent Rood, Michael J. Lewis	Scheduling on the Grid via multi-state resource availability prediction.	GRID	2008	DBLP DOI BibTeX RDF
18	Reiji Suda	Divisible load scheduling with improved asymptotic optimality.	CLUSTER	2008	DBLP DOI BibTeX RDF
18	Leah Epstein, Rob van Stee	Preemptive Scheduling on Selfish Machines.	CAAN	2007	DBLP DOI BibTeX RDF
18	Bo Li 0025, Dongfeng Zhao	Online Algorithms for Single Machine Schedulers to Support Advance Reservations from Grid Jobs.	HPCC	2007	DBLP DOI BibTeX RDF
18	Yuxiong He, Wen-Jing Hsu, Charles E. Leiserson	Provably Efficient Online Non-clairvoyant Adaptive Scheduling.	IPDPS	2007	DBLP DOI BibTeX RDF
18	Jinghui Zhang, Junzhou Luo	An Adaptive QoS Group Guided Grid Scheduling Algorithm with Task Replicas.	CSCWD	2007	DBLP DOI BibTeX RDF
18	Michael Gatto, Peter Widmayer	On the Robustness of Graham's Algorithm for Online Scheduling.	WADS	2007	DBLP DOI BibTeX RDF
18	Ron Lavi, Chaitanya Swamy	Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity.	EC	2007	DBLP DOI BibTeX RDF	scheduling, approximation algorithms, mechanism design
18	Yong Hou, Jiong Yu, Turgun	NDA-MM: A New Adaptive Task Scheduling Algorithm Based on the Non-dedicated Constraint Grid.	GCC	2007	DBLP DOI BibTeX RDF
18	Fatos Xhafa, Leonard Barolli, Arjan Durresi	Immediate Mode Scheduling of Independent Jobs in Computational Grids.	AINA	2007	DBLP DOI BibTeX RDF
18	I-Hong Kuo, Shi-Jinn Horng, Tzong-Wann Kao, Tsung-Lieh Lin, Pingzhi Fan	An Efficient Flow-Shop Scheduling Algorithm Based on a Hybrid Particle Swarm Optimization Model.	IEA/AIE	2007	DBLP DOI BibTeX RDF	Flow-Shop Scheduling Problem, Random-Key Encoding Scheme, Individual Enhancement Scheme, Particle Swarm Optimization
18	Enrico Giunchiglia, Marco Maratea	SAT-Based Planning with Minimal-#actions Plans and "soft" Goals.	AI*IA	2007	DBLP DOI BibTeX RDF
18	Yumei Huo, Joseph Y.-T. Leung	Minimizing mean flow time for UET tasks.	ACM Trans. Algorithms	2006	DBLP DOI BibTeX RDF	intrees, mean flow time, Scheduling, approximation algorithms, precedence constraints
18	Shanshan Song, Kai Hwang 0001, Yu-Kwong Kwok	Risk-Resilient Heuristics and Genetic Algorithms for Security-Assured Grid Job Scheduling.	IEEE Trans. Computers	2006	DBLP DOI BibTeX RDF	job scheduling heuristics, replication scheduling, risk resilience, NAS and PSA benchmarks, genetic algorithm, Grid computing, performance metrics, distributed supercomputing
18	Bernat Duran, Fatos Xhafa	The effects of two replacement strategies on a genetic algorithm for scheduling jobs on computational grids.	SAC	2006	DBLP DOI BibTeX RDF	struggle replacement, genetic algorithms, evolutionary computing, computational grid, computational grids, job scheduling, steady-state
18	Qun Niu, Xingsheng Gu	An Improved Genetic-Based Particle Swarm Optimization for No-Idle Permutation Flow Shops with Fuzzy Processing Time.	PRICAI	2006	DBLP DOI BibTeX RDF
18	Tomasz Sliwinski, Eugeniusz Toczylowski	Preemptive Jobs Scheduling on Parallel Machines with Setup Times and Renewable Resources.	APMS	2006	DBLP DOI BibTeX RDF
18	Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir	Transactional contention management as a non-clairvoyant scheduling problem.	PODC	2006	DBLP DOI BibTeX RDF	scheduling, concurrency control, transactions, contention management, software transactional memory
18	Morteza Bagherpour, Siamak Noori, Seyed Jafar Sadjadi	Cost - Time Trade Off Models Application to Crashing Flow Shop Scheduling Problems.	ICCSA (3)	2006	DBLP DOI BibTeX RDF
18	EunJoung Byun, HongSoo Kim, SungJin Choi, Chong-Sun Hwang	Probabilistic Observation Prediction Model based E4 Scheduling Mechanism in Peer to Peer Grid Computing.	GCC	2006	DBLP DOI BibTeX RDF
18	Fang Dong 0001, Junzhou Luo, Lisha Gao, Liang Ge	A Grid Task Scheduling Algorithm Based on QoS Priority Grouping.	GCC	2006	DBLP DOI BibTeX RDF
18	Jian-Jun Han, Duo-Qiang Wang	Edge Scheduling Algorithms in Parallel and Distributed Systems.	ICPP	2006	DBLP DOI BibTeX RDF
18	Nagavijayalakshmi Vydyanathan, Sriram Krishnamoorthy, Gerald Sabin, Ümit V. Çatalyürek, Tahsin M. Kurç, P. Sadayappan, Joel H. Saltz	An Integrated Approach for Processor Allocation and Scheduling of Mixed-Parallel Applications.	ICPP	2006	DBLP DOI BibTeX RDF
18	Ewa Figielska	Combining an Optimizing Method with a Genetic Algorithm to Solve a Flowshop Scheduling Problem with Additional Resources.	ETFA	2006	DBLP DOI BibTeX RDF
18	Nagavijayalakshmi Vydyanathan, Sriram Krishnamoorthy, Gerald Sabin, Ümit V. Çatalyürek, Tahsin M. Kurç, P. Sadayappan, Joel H. Saltz	Locality Conscious Processor Allocation and Scheduling for Mixed Parallel Applications.	CLUSTER	2006	DBLP DOI BibTeX RDF
18	Byung Joo Park, Hyung Rim Choi, Hae Kyoung Kwon, Moo Hong Kang	Simulation Analysis on Effective Operation of Handling Equipments in Automated Container Terminal.	Australian Conference on Artificial Intelligence	2006	DBLP DOI BibTeX RDF	Automated Container Terminal, Integrated Operation
18	V. S. Anil Kumar 0001, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan	Approximation Algorithms for Scheduling on Multiple Machines.	FOCS	2005	DBLP DOI BibTeX RDF
18	Rodolphe Giroudeau, Jean-Claude König, Feryal-Kamila Moulaï, Jérôme Palaysi	Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays.	Euro-Par	2005	DBLP DOI BibTeX RDF
18	Kusuma Rojanapibul, Juta Pichitlamken	Assessing risk in a job schedule: integrating a scheduling heuristic and a simulation model to a spreadsheet.	WSC	2005	DBLP DOI BibTeX RDF
18	Jérôme Fortin, Pawel Zielinski 0001, Didier Dubois, Hélène Fargier	Interval Analysis in Scheduling.	CP	2005	DBLP DOI BibTeX RDF
18	V. S. Anil Kumar 0001, Madhav V. Marathe, Srinivasan Parthasarathy 0002, Aravind Srinivasan	Scheduling on Unrelated Machines Under Tree-Like Precedence Constraints.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
18	Leah Epstein, Tamir Tassa	Optimal Preemptive Scheduling for General Target Functions.	MFCS	2004	DBLP DOI BibTeX RDF
18	Stephen D. Kleban, J. R. Johnston, James A. Ang, Scott H. Clearwater	With great reliability comes great responsibility: tradeoffs of run-time policy on high reliability systems.	CCGRID	2004	DBLP DOI BibTeX RDF
18	Martin Gairing, Thomas Lücking 0001, Marios Mavronicolas, Burkhard Monien	Computing Nash equilibria for scheduling on restricted parallel links.	STOC	2004	DBLP DOI BibTeX RDF	approximation algorithms, Nash equilibria, selfish routing, unsplittable flow, machine scheduling
18	Roman A. Koryakin	On Asymptotic Optimality of Permutation Schedules in Stochastic Flow Shops and Assembly Lines.	OR	2004	DBLP DOI BibTeX RDF
18	Christoph Roser, Masaru Nakano, Minoru Tanaka	Manufacturing analysis and control: buffer allocation model based on a single simulation.	WSC	2003	DBLP DOI BibTeX RDF
18	Abdel Krim Amoura, Evripidis Bampis, Claire Kenyon, Yannis Manoussakis	Scheduling Independent Multiprocessor Tasks.	Algorithmica	2002	DBLP DOI BibTeX RDF	Scheduling, Approximation, Multiprocessor tasks
18	Susana C. Esquivel, Guillermo Leguizamón, Federico Zuppa, Raúl Héctor Gallard	A Performance Comparison of Alternative Heuristics for the Flow Shop Scheduling Problem.	EvoWorkshops	2002	DBLP DOI BibTeX RDF
18	Sönke Hartmann	Project Scheduling with Multiple Modes: A Genetic Algorithm.	Ann. Oper. Res.	2001	DBLP DOI BibTeX RDF	project management and scheduling, computational results, genetic algorithms, local search, multiple modes
18	Tak Wah Lam, Fung Ling Yue	Optimal Edge Ranking of Trees in Linear Time.	Algorithmica	2001	DBLP DOI BibTeX RDF	Scheduling, Approximation, Multiprocessor tasks
18	Daniel W. Engels, Jon Feldman, David R. Karger, Matthias Ruhl	Parallel processor scheduling with delay constraints.	SODA	2001	DBLP BibTeX RDF
18	Jessen T. Havill	Online Packet Routing on Linear Arrays and Rings.	ICALP	2001	DBLP DOI BibTeX RDF
18	Cristina Boeres, Gerson N. da Cunha, Vinod E. F. Rebello	On Minimising the Processor Requirements of LogP Schedules.	Euro-Par	2001	DBLP DOI BibTeX RDF
18	Yasuhiro Tsujimura, Yuichiro Mafune, Mitsuo Gen	Effects of Symbiotic Evolution in Genetic Algorithms for Job-Shop Scheduling.	HICSS	2001	DBLP DOI BibTeX RDF	Symbiotic Mechanism, Genetic Algorithm, Job-shop Scheduling
18	Hannah Bast	On Scheduling Parallel Tasks at Twilight.	Theory Comput. Syst.	2000	DBLP DOI BibTeX RDF
18	Kathleen Steinhöfel, Andreas Alexander Albrecht, Chak-Kuen Wong	Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems.	CIAC	2000	DBLP DOI BibTeX RDF
18	R. Di Lorenzo, S. Fichera, V. Grasso	Scheduling a cellular manufacturing system with GA.	KES (3)	1998	DBLP DOI BibTeX RDF
18	Maria J. Serna, Fatos Xhafa	Approximating Scheduling Problems in Parallel.	Euro-Par	1997	DBLP DOI BibTeX RDF
18	Theodore Andronikos, Nectarios Koziris, George K. Papakonstantinou, Panayotis Tsanakas	Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs.	IPPS	1997	DBLP DOI BibTeX RDF
18	Michael A. Palis, Jing-Chiou Liou, David S. L. Wei	Task Clustering and Scheduling for Distributed Memory Parallel Architectures.	IEEE Trans. Parallel Distributed Syst.	1996	DBLP DOI BibTeX RDF	Program task graph, task granularity, approximation algorithms, task scheduling, distributed memory architectures
18	Rolf H. Möhring, Markus W. Schäffter, Andreas S. Schulz	Scheduling Jobs with Communication Delays: Using Infeasible Solutions for Approximation (Extended Abstract).	ESA	1996	DBLP DOI BibTeX RDF
18	Cynthia A. Phillips, Clifford Stein 0001, Joel Wein	Task Scheduling in Networks (Extended Abstract).	SWAT	1994	DBLP DOI BibTeX RDF
18	Luis Diego Briceno, Howard Jay Siegel, Anthony A. Maciejewski, Mohana Oltikar, Jeff Brateman, Joe White, Jonathan R. Martin, Keith Knapp	Heuristics for Robust Resource Allocation of Satellite Weather Data Processing on a Heterogeneous Parallel System.	IEEE Trans. Parallel Distributed Syst.	2011	DBLP DOI BibTeX RDF	satellite system, revenue and two-part resource allocation, robustness, Heterogeneous computing, makespan
18	Fatos Xhafa, Joanna Kolodziej, Leonard Barolli, Akli Fundo	A GA+TS Hybrid Algorithm for Independent Batch Scheduling in Computational Grids.	NBiS	2011	DBLP DOI BibTeX RDF	Flowtime, Genetic Algorithms, Tabu Search, Hybridization, Computational Grids, Makespan, Meta-heuristics
18	Louis-Claude Canon, Emmanuel Jeannot	Evaluation and Optimization of the Robustness of DAG Schedules in Heterogeneous Environments.	IEEE Trans. Parallel Distributed Syst.	2010	DBLP DOI BibTeX RDF	robustness, DAG, makespan, stochastic scheduling
18	Sumeyye Samur, Serol Bulkan	Three Genetic Algorithm Approaches to Parallel Machine Scheduling and Comparison with a Heuristic.	ITNG	2010	DBLP DOI BibTeX RDF	genetic algorithm, heuristic, makespan, release time, parallel machine scheduling
18	Xiao-Min Zhu, Peizhong Lu	Multi-Dimensional Scheduling for Real-Time Tasks on Heterogeneous Clusters.	J. Comput. Sci. Technol.	2009	DBLP DOI BibTeX RDF	clusters, scheduling, real-time, heterogeneous, makespan, multi-dimensional
18	Wael Abdulal, Omar Al Jadaan, Ahmad Jabas, Ramachandram Sirandas, Mustafa Kaiiali, C. Raghavendra Rao 0001	Rank-Based Genetic Algorithm with Limited Iteration for Grid Scheduling.	CICSyN	2009	DBLP DOI BibTeX RDF	Genetic Algorithms, Rank, Makespan, Grid Scheduling
18	Jochen Mundinger, Richard R. Weber, Gideon Weiss	Optimal scheduling of peer-to-peer file dissemination.	J. Sched.	2008	DBLP DOI BibTeX RDF	BitTorrent protocol, Broadcasting problem, Performance evaluation, Peer-to-peer, Load balancing, Content distribution, File sharing, Makespan
18	Rongheng Li, Huei Chuen Huang	List scheduling for jobs with arbitrary release times and similar lengths.	J. Sched.	2007	DBLP DOI BibTeX RDF	Makespan, Competitive ratio, List scheduling, On-line scheduling
18	George Steiner, Zhihui Xue	On the connection between a cyclic job shop and a reentrant flow shop scheduling problem.	J. Sched.	2006	DBLP DOI BibTeX RDF	Reentrant flow shop, Algorithms and complexity, Makespan, Job shop, Cycle time
18	Mohamed Haouari, Anis Gharbi	Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails.	Ann. Oper. Res.	2004	DBLP DOI BibTeX RDF	identical parallel machines, delivery times, scheduling, lower bound, makespan, release dates
18	Siqun Wang, Monique Guignard 0001	Redefining Event Variables for Efficient Modeling of Continuous-Time Batch Processing.	Ann. Oper. Res.	2002	DBLP DOI BibTeX RDF	continuous-time model, scheduling, integer programming, event, makespan, batch
18	Maxim Sviridenko, Gerhard J. Woeginger	Approximability and in-approximability results for no-wait shop scheduling.	FOCS	2000	DBLP DOI BibTeX RDF	in-approximability results, no-wait shop scheduling, makespan criterion, computational complexity, approximability, processor scheduling, polynomial time approximation scheme, polynomial approximation, APX-hard
18	Edward G. Coffman Jr., M. R. Garey	Proof of the 4/3 Conjecture for Preemptive vs. Nonpreemptive Two-Processor Scheduling.	J. ACM	1993	DBLP DOI BibTeX RDF	makespan scheduling, preemptive scheduling
14	David Tremblet, Simon Thevenin, Alexandre Dolgui	Makespan estimation in a flexible job-shop scheduling environment using machine learning.	Int. J. Prod. Res.	2024	DBLP DOI BibTeX RDF
14	Yenny Alexandra Paredes-Astudillo, Valerie Botta-Genoulaz, Jairo R. Montoya-Torres	Impact of learning effect modelling in flowshop scheduling with makespan minimisation based on the Nawaz-Enscore-Ham algorithm.	Int. J. Prod. Res.	2024	DBLP DOI BibTeX RDF
14	Lei Liu, Marcello Urgo	A branch-and-bound approach to minimise the value-at-risk of the makespan in a stochastic two-machine flow shop.	Int. J. Prod. Res.	2024	DBLP DOI BibTeX RDF
14	Lijun He, Jiandong Li 0001, Yanting Wang, Jiangbin Zheng, Liang He	Balancing Total Energy Consumption and Mean Makespan in Data Offloading for Space-Air-Ground Integrated Networks.	IEEE Trans. Mob. Comput.	2024	DBLP DOI BibTeX RDF
14	Boris Kogan, Tatyana Chernonog, Avi Herbon	Project scheduling to minimize the makespan under flexible resource profiles and marginal diminishing returns of the resource.	Comput. Oper. Res.	2024	DBLP DOI BibTeX RDF
14	Radoslaw Puka, Iwona Skalna, Jerzy Duda, Adam Stawowy	Deterministic constructive vN-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion.	Comput. Oper. Res.	2024	DBLP DOI BibTeX RDF