Similar Search Results

Novel Job Scheduling Tool for University Technology Transfer

Hamilton, Clovia - 2020

Technology commercialization managers are often faced with (1) training inventors on intellectual property (IP) laws and IP policies, (2) evaluating invention disclosures for patentability and marketability, (3) drafting and implementing invention marketing plans, and (4) working closely with...

Persistent link: https://www.econbiz.de/10014102035

Transformation of Job Shop to Flow Shop in an Era of Global Crises

Akcay Kasapoglu, Ozlem - 2017

The differentiation of products and services parallel with the globalization, motivated researchers to commit resources within supply chains more effectively. Competitive nature of the markets requires innovativeness with swift actions to supply mass customized demand. The total cost in the...

Persistent link: https://www.econbiz.de/10012962781

A Literature Review on Production Scheduling with the Drum-Buffer-Rope Technique

Tayalı, H. Alper - 2017

Minimizing production cost is a key element of the industry. To use resources efficiently, various concepts of operations management have been developed since the Industrial Revolution such as just in time, total quality control or lean manufacturing. Manufacturing shops – classified broadly...

Persistent link: https://www.econbiz.de/10012962782

Scheduling Deliveries Under Uncertainty

Dekker, Rommert - 2011

beforehand as well as windows in which the jobs need to be done. We develop several heuristics to solve the problem at hand. The …

Persistent link: https://www.econbiz.de/10013134525

Profit-oriented scheduling of resource-constrained projects with flexible capacity constraints

Schnabel, André; Kellenbrink, Carolin; Helber, Stefan - 2017

We consider a novel generalization of the resource-constrained project scheduling problem (RCPSP). Unlike many established approaches for the RCPSP that aim to minimize the makespan of the project for given static capacity constraints, we consider the important real-life aspect that capacity...

Persistent link: https://www.econbiz.de/10011655297

Minimizing Makespan in Flowshops with Pallet Requirements : Computational Complexity

Wang, M. W. - 2010

We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m =2...

Persistent link: https://www.econbiz.de/10013152472

Sequencing Heuristics for Storing and Retrieving Unit Loads in 3d Compact Automated Warehousing Systems

Yu, Yugang - 2011

. Although the sequencing problem is NP-hard some very good heuristics exist. Surprisingly the problem has not yet been … objective to minimize the makespan. We adapt well-known sequencing heuristics for the multi-deep system, and propose and … consistently outperforms all the other heuristics. Generally, it can outperform the benchmark first-come first-served (FCFS …

Persistent link: https://www.econbiz.de/10013128047

Heuristic Procedures for Minimizing Makespan and the Number of Required Pallets

Chu, Chengbin - 2017

A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number...

Persistent link: https://www.econbiz.de/10012746785

Earliness-Tardiness Scheduling Problems, II : Deviation of Completion Times About a Restrictive Common Due Date

Hall, Nicholas G. - 2017

A companion paper (Part I) considers the problem of minimizing the weighted earliness and tardiness of jobs scheduled on a single machine around a common due date, d, which is unrestrictively late. This paper (Part II) considers the problem of minimizing the unweighted earliness and tardiness of...

Persistent link: https://www.econbiz.de/10012746786

A Simple Optimised Search Heuristic for the Job-Shop Scheduling Problem

Fernandes, Susana - 2007

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times

Persistent link: https://www.econbiz.de/10012775941