Suchergebnisse - (("mixed binary integer programming") OR ("mixed binary interior programming"))

Mixed binary integer programming formulations for the reentrant job shop scheduling problem von Pan, Jason Chao-Hsien, Chen, Jen-Shiang

“… This paper describes the development of mixed binary integer programming (BIP) formulations for the reentrant job shop scheduling problem …”
Volltext

Modeling and optimization of an electric power distribution network planning system using mixed binary integer programming von Ogunwolu, L., Ero, O., Ibidapo-Obe, O.

Volltext

Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling von Ziaee, Mohsen, Sadjadi, S.J.

“… The model is formulated in a form of mixed binary integer programming. The primary goal of this paper is to develop operation schedules that specify the completion time of operations …”
Volltext

A hybrid approach for solving mixed binary integer programming problems von Mat Shariff, Mastura Binti

“… Optimisation appears in many aspects of day to day life and more often, involves integer optimisation of very large scales. Although technology advancements …”
Volltext

A parameter-free approach for estimating the quality and quantity of the right and left returns to scale in Data Envelopment Analysis von Mirbolouki, Mahnaz, Allahyar, Maryam

“… •This paper studies the estimation of the right and left returns to scale.•The new method detects both the type and the value of returns to scale.•The …”
Volltext

Optimizing blocking flow shop scheduling problem with total completion time criterion von Moslehi, Ghasem, Khorasanian, Danial

“… We present two mixed binary integer programming models, one of which is based on the departure times of jobs from machines, and the other is based on the idle and blocking times of jobs …”
Volltext

Scheduling Jobs on a Single Machine With Dirt Cleaning Consideration to Minimize Total Completion Time von Chen, Yarong, Su, Ling-Huey, Tsai, Ya-Chih, Huang, Shenquan, Chou, Fuh-Der

“… not exceed the limit. The objective is to minimize the total completion times. A mixed binary integer programming model is formulated, and, due to its computational …”
Volltext

Joint versus separate spectrum sensing and resource allocation in OFDMA-based cognitive radio networks von Janatian, Nafiseh, Modarres-Hashemi, Mahmood, Sun, Sumei

“… ’ quality of service and detection probability of the primary user. This is a mixed binary integer programming problem which is NP …”
Volltext

Low Complexity Coordination Strategies at Multi-Lane Intersections von Liu, Changhao, Mo, Yangan, Gao, Bo, Zhang, Tingting

“… Aiming at the essential non-convex problem, we try to reformulate the original problem into an mixed binary integer programming (MBIP …”
Volltext

Optimal component configuration and component routing von Avramopoulos, I.C., Anagnostou, M.E.

“… Optimal solutions are found either through a mixed binary integer programming formulation or by employing max flow computations …”
Volltext

A genetic algorithm for the simultaneous delivery and pickup problems with time window von Wang, Hsiao-Fan, Chen, Ying-Yen

“… ► A mixed binary integer programming model denoted by SDPPTW is formulated. ► A co-evolution genetic algorithm is developed for solution …”
Volltext

Minimizing total absolute deviation of job completion times on a single machine with cleaning activities von Su, Ling-Huey, Wang, Hui-Mei

“… •Taking into the consideration of dirt cleaning activities, a common practice in IC manufacturing industry.•Prove the positional weights in a given sequence …”
Volltext

Scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan von Chen, Jen-Shiang

“… Two mixed binary integer programming (BIP) models are provided for deriving the optimal solution …”
Volltext

A coevolutionary algorithm for the flexible delivery and pickup problem with time windows von Wang, Hsiao-Fan, Chen, Ying-Yen

“… This paper addresses a flexible delivery and pickup problem with time windows (FDPPTW) and formulates the problem into a mixed binary integer programming model …”
Volltext

Optimization models for the tool change scheduling problem von Chen, Jen-Shiang

“… In this paper, we examine this problem to minimize the total tardiness of jobs. Two mixed binary integer programming models are developed to optimally solve this problem …”
Volltext

Energy efficient resource allocation based on relay selection and subcarrier pairing with channel uncertainty in cognitive radio network von Liu, Zhixin, Liang, Changjian, Yuan, Yazhou, Guan, Xinping

“… user’s minimum transmit rate requirement. The original optimization problem is non-convex with consideration of the channel uncertainty, and it is the mixed binary integer programming problem …”
Volltext

Plug-and-Play Framework for Assessment of Renewable Energy Community Strategies von Faria, J. P. D., Pombo, J. A. N., Mariano, S. J. P. S., Calado, M. R. A.

“… Recent regulatory advancements by the European Union have positioned Renewable Energy Communities (RECs) at the forefront of energy policy discussions, …”
Volltext

Joint Load Balancing of Downlink and Uplink for eICIC in Heterogeneous Network von Zheng, Jie, Li, Jiandong, Wang, Nannan, Yang, Xiaoniu

“… The 3GPP has proposed enhanced intercell interference coordination (eICIC) by making the macrocell silent in the almost blank subframes (ABSs) to mitigate …”
Volltext

Enhancing Spectral Efficiency of Short-Packet Communications in STAR-RIS-Assisted SWIPT MIMO-NOMA Systems With Deep Learning von Perdana, Ridho Hendra Yoga, Nguyen, Toan-Van, Pramitarini, Yushintia, Nguyen, Duy H. N., An, Beongku

“… This paper proposes an adaptive user grouping (AUG) scheme for short-packet communication (SPC) in simultaneous transmitting and reflecting …”
Volltext

Scheduling multiple orders per job in a single machine to minimize total completion time von Mason, Scott J., Chen, Jen-Shiang

“… The performance measure is the total completion time of all orders. Two mixed binary integer programming models are developed to optimally solve this problem …”
Volltext